Assignment No.
1
Semester No.1 Spring 2025
MTH202 – Discrete Mathematics
Question no: 1
Construct the truth table for the following compound proposition.
[(p∨~q) ∧ (r∨~p)] ∨(q∧~r)
Solution:
Truth Table of the given Compound proposition:
[(p∨~q) ∧ (r∨~p)] ∨(q∧~r)
p q r ∼p ~q ~r P∨~q r∨~p q∧~r [(p∨~q) ∧ [(p∨~q) ∧ (r∨~p)]
(r∨~p)] ∨(q∧~r)
T T T F F F T T T F T
T T F F F T T F F T T
T F T T F F T T T F T
T F F T F T T F F F F
F T T F T F F T F F F
F T F F T T F T F T T
F F T T T F T T T F T
F F F T T T T T T F T
Question no: 2
Given Propositions:
o P: You complete all assignments
o q: You attend all lectures
o r: You understand the course material
o s: You pass the course
Translate the following English sentences into logical expressions using p, q, r, and s, along with
logical symbols (~, ⋁, ⋀ , → )
1. If you complete all assignments, then you will understand the course material.
2. If you attend all lectures, then you will understand the course material.
3. If you both complete all assignments and attend all lectures, then you will pass the course
4. If you do not understand the course material, then you will not pass the course.
5. If you do not complete all assignments or do not attend all lectures, then you will not pass the course.
Solution:
Given Propositions:
- P: You complete all assignments
- q: You attend all lectures
- r: You understand the course material
- s: You pass the course
Logical symbols that we will use:
o ~ NOT
o ⋁ OR
o ⋀ AND
o → IMPLIES
Logical Translations:
1. If you complete all assignments, then you will understand the course material.
p→r
2. If you attend all lectures, then you will understand the course material.
q→r
3. If you both complete all assignments and attend all lectures, then you will pass the
(p ⋀ q) → s
course.
4. If you do not understand the course material, then you will not pass the course.
~r → ~s
5. If you do not complete all assignments or do not attend all lectures, then you will not
(~p ⋁ ~q) → ~s
pass the course.
Question no: 3
(p → (q ∧ r)) ↔ ((p → q) ∧ (p → r))
Show that the following logical expression is a tautology:
Solution:
To show that the logical expression is a tautology, we need to verify that it is always true for
all possible truth values of the propositions involved.
So we need to construct the truth table to find the final answer
(p → (q ∧ r)) ↔ ((p
q∧ p → (q ∧ (p → q) ∧ (p →
p q r p→q p→r → q) ∧ (p → r))
r r) r)
T T T T T T T T T
T T F F F T F F T
T F T F F F T F T
T F F F F F F F T
F T T T T T T T T
F T F F T T T T T
F F T F T T T T T
F F F F T T T T T
When p is false, implications like p→ are always true.
The expression p→ (q ∧ r) is logically equivalent to (p→ q) ∧ (p→ r)
(A compound proposition is a tautology if its truth table has all T (true) in the final column.)
(p → (q ∧ r)) ↔ ((p → q) ∧ (p → r)) is a tautology, because it is true for all combinations of
truth values for p, q, and r.
Question no: 4
Given the following universal set U and its two subsets P and Q, where:
𝑈= {𝑥|𝑥 ∈ ℤ ,0≤𝑥≤10}
𝑃={𝑥|𝑥 𝑖𝑠 𝑎 𝑝𝑟𝑖𝑚𝑒 𝑛𝑢𝑚𝑏𝑒𝑟}
𝑄={𝑥|𝑥^2<50}
Prove the following statement:
(P ∪ Q) ᶜ= Pᶜ ∩ Qᶜ
Solution:
the universal set U
U= {x∈Z∣0≤x≤10} = {0,1,2,3,4,5,6,7,8,9,10}
subset P (prime numbers in U)
Prime numbers between 0 and 10 are:
P= {2,3,5,7}
subset Q where x^2<50
Find all values in U where x^2<50:
X^2<50⇒x<50≈7.07⇒x=0,1,2,3,4,5,6,7
So:
Q= {0,1,2,3,4,5,6,7}
P∪Q
P∪Q= {0,1,2,3,4,5,6,7}
complement (P ∪ Q) ᶜ
Elements in U but not in P∪Q
(P ∪ Q) ᶜ=U−(P∪Q) ={8,9,10}
Pc and Qᶜ
Pᶜ =U−P= {0,1,4,6,8,9,10}
Qᶜ=U−Q= {8,9,10}
Pᶜ ∩ Qᶜ
Pᶜ ∩ Qᶜ= {8,9,10}
Conclusion:
(P ∪ Q) ᶜ= {8,9,10} = Pᶜ ∩ Qᶜ
Hence proved.
This confirms that:
(P ∪ Q) ᶜ= Pᶜ ∩ Qᶜ
is true for the given sets.
