MTH202 ASSIGNMENT NO 01 SOLUTION:

Question: 1
Use truth tables to determine if the given argument is valid or
invalid
p ∧q → r

p❑ q
q→ p
∴ r

SOLUTION:

p q r p ∧q r p ∧q → r q p❑ q q→ p r

T T T T F F F T T F
T T F T T T F T T T
T F T F F T T T T F
T F F F T T T T T T
F T T F F T F F T F
F T F F T T F F T T
F F T F F T T T F F
F F F F T T T T F T

2 and row 4) , the conclusion r is also true.

We observe that in some rows where all premises are true (such as row

However, in other rows (like row 1), the premises are true, but the
conclusion is false.

 Since there are instances where the premises are true and the
conclusion is false, the argument is invalid.

QUESTION NO 02:

Use De Morgan’s Laws to find the negation of each of the following

statements.
 (a)Jan is rich and happy.
(b)Carlos will bicycle or run tomorrow.
(c) Mei walks or takes the bus to class.
(d)Ibrahim is smart and hard working.

SOLUTION:

(a) Jan is rich and happy.

The statement can be written as:

p ∧q , where p = "Jan is rich" and q = "Jan is happy."

Negating this using De Morgan's Law:

( p ∧q )= p❑ q

Which translates to:

"Jan is not rich or Jan is not happy."

(b) Carlos will bicycle or run tomorrow.

The statement can be written as:

 p q , where p = "Carlos will bicycle tomorrow" and q = "Carlos will run

tomorrow."

Negating this using De Morgan's Law:

( p q) = p ∧ q

Which translates to:

"Carlos will not bicycle tomorrow and Carlos will not run tomorrow."

(c) Mei walks or takes the bus to class.

The statement can be written as:

 p q , where p = "Mei walks to class" and q = "Mei takes the bus to
class."

Negating this using De Morgan's Law:

( p q) = p ∧ q
Which translates to:

"Mei does not walk to class and Mei does not take the bus to class."

(d) Ibrahim is smart and hard working.

The statement can be written as:

p ∧q , where p = "Ibrahim is smart" and q = "Ibrahim is hard working."

Negating this using De Morgan's Law

( p ∧q )= p❑ q

Which translates to:

"Ibrahim is not smart or Ibrahim is not hard working."

QUESTION NO 03:
p q r r q❑ r p ∧(q ❑ r ) ( p ∧ ( q ❑ r ))
1 1 1 0 1 1 0
1 1 0 1 1 1 0
1 0 1 0 0 0 1
1 0 0 1 1 1 0

0 1 1 0 1 0 1
0 1 0 1 1 0 1
0 0 1 0 0 0 1
0 0 0 1 1 0 1

QUESTION NO 04:

Construct an algebraic proof for the given statements. Cite the

For all sets 𝐴, 𝐵 and 𝐶, ( A − B ) ∪ ( B − A )=( A ∪ B ) − ( A ∩ B )

property\definition\law\theorem used at each step.

SOLUTION:

1: Show ( A − B ) ∪ ( B − A ) ⊆ ( A ∪ B ) − ( A ∩ B )

Let x ∈ ( A − B ) ∪ ( B − A )

Then, by definition of union,

x ∈ ( A − B )∨x ∈ ( B − A )
case 1: x ∈ ( A − B )
 tℎen x ∈ A∧x ∉ B
x ∈ A ∪ B ( sin c e x ∈ A )
x ∉ A ∩B ( sin c ex ∉ B )
so x ∈ ( A ∪ B ) − ( A ∩ B )

Case 2 : x ∈ B − A
Tℎen x ∈ B∧x ∉ A
x ∈ A ∪ B ( sin c e x ∈ B )
x ∉ A ∩B ( sin c e x ∉ A )
Sox ∈ ( A ∪ B ) − ( A ∩ B )
Therefore, in both cases,
x ∈ ( A ∪B )− ( A ∩ B )

Tℎus , ( A − B ) ∪ ( B− A ) ⊆ ( A ∪ B ) − ( A ∩ B )

2. Sℎow ( A ∪B ) − ( A ∩B ) ⊆ ( A − B ) ∪ ( B− A )

Letx ∈ ( A ∪ B ) − ( A ∩ B )
Tℎen : x ∈ A ∪ B∧x ∉ A ∩ B
Sox ∈ A∨x ∈ B ,∧x ∉ A ∩B ,i . e . , notbotℎ.

Case 1 : x ∈ A∧x ∉ B
x∈ A −B
x ∈ ( A − B) ∪(B − A )
Case 2 : x ∈ B∧x ∉ A
x∈B− A
x ∈ ( A − B) ∪(B − A )
In both cases:
x ∈ ( A − B) ∪(B − A )
So , ( A ∪ B ) − ( A ∩ B ) ⊆ ( A − B ) ∪ ( B − A )
Since both directions of the subset relation hold, we conclude that:
( A − B ) ∪ ( B − A )=( A ∪ B ) − ( A ∩ B )