Worksheet 1 and 2 Answer Key

May 11, 2024

1. (a) This sentence is a proposition. It is a true proposition.

(b) This sentence is a proposition. It can be verified as either true or
false based on the existence and location of Bahir Dar.(True)
(c) This sentence is a proposition. It states a mathematical fact that
is true for all real numbers x.
(d) This sentence is not a proposition. It is an expression of gratitude
rather than a statement that is true or false.
(e) This sentence is a proposition. It makes a claim about the sum
of odd numbers, which can be verified as true based on number
theory.
(f) This sentence is a proposition. It asserts a historical claim that
could potentially be evaluated as true or false based on archaeo-
logical evidence.
(g) This sentence is a proposition. It makes a mathematical claim
about the primality of the number 9, which is false (since 9 is not
prime).
(h) This sentence is not a proposition. It expresses a personal inten-
tion or determination, which cannot be evaluated as true or false
in the same way as factual statements.
Therefore, the propositions are: a), b), c), e), f), and g).

2. (a) ¬p ∧ ¬q
(b) p ⇒ q or ¬p ∨ q
(c) q ⇒ p
(d) p ⇒ ¬q

3. (a) T

1
 (b) T
(c) T
(d) T

4. (a) T
(b) F
(c) T
(d) F

(p ∧ q) ⇒ r ≡ ¬(p ∧ q) ∨ r
≡ (¬p ∨ ¬q) ∨ r
5. (a) ≡ ¬p ∨ (¬q ∨ r)
≡ p ⇒ (¬q ∨ r)
≡ p ⇒ (q ⇒ r)
Therefore, (p ∧ q) ⇒ r ≡ p ⇒ (q ⇒ r).

¬(p ⇔ q) ≡ ¬((p ⇒ q) ∧ (q ⇒ p))

≡ (p ∧ ¬q) ∨ (q ∧ ¬p)
≡ [(p ∧ ¬q) ∨ q] ∧ [(p ∧ ¬q) ∨ ¬p]
≡ [(p ∨ q) ∧ (¬q ∨ q)] ∧ [(p ∨ ¬p) ∧ (¬q ∨ ¬p)]
(b)
≡ [(p ∨ q) ∧ t] ∧ [t ∧ (¬q ∨ ¬p)]
≡ (p ∨ q) ∧ (¬q ∨ ¬p)
≡ (¬p ⇒ q) ∧ (q ⇒ ¬p)
≡ ¬p ⇔ q
Therefore, ¬(p ⇔ q) ≡ ¬p ⇔ q.

2
 ¬(p ⇔ q) ≡ ¬((p ⇒ q) ∧ (q ⇒ p))
≡ (p ∧ ¬q) ∨ (q ∧ ¬p)
≡ [(p ∧ ¬q) ∨ q] ∧ [(p ∧ ¬q) ∨ ¬p]
≡ [(p ∨ q) ∧ (¬q ∨ q)] ∧ [(p ∨ ¬p) ∧ (¬q ∨ ¬p)]
≡ [(p ∨ q) ∧ t] ∧ [t ∧ (¬q ∨ ¬p)]
≡ (p ∨ q) ∧ (¬q ∨ ¬p)
≡ (¬q ∨ ¬p) ∧ (p ∨ q)
≡ (¬p ∨ ¬q) ∧ (q ∨ p)
≡ (p ⇒ ¬q) ∧ (¬q ⇒ p)
≡ p ⇔ ¬q
Therefore, ¬(p ⇔ q) ≡ p ⇔ ¬q.
From the above two equivalences, we conclude that,

¬(p ⇔ q) ≡ ¬p ⇔ q ≡ p ⇔ ¬q

6. (a) Neither
(b) Tautology
(c) Tautology
(d) Neither

7. (a) F; Take x = 8, p(8) ⇒ q(8) is false

(b) T; Take x = 3, q(3) ⇒ p(3) is true.
(c) F; Take x = 4, p(4) ∨ q(4) is false.
(d) T; Take x = 2, ¬p(2) ∧ q(2) is True

8. (a) T; law of trichotomy

(b) T; For all x, y ∈ R, we can find z = −x − y ∈ R such that
x + y + z = 0.
(c) T; Take x = 2 and y = π, 2 ≤ π is True.
(d) T; For all x ∈ R, we can find y = 2 − x ∈ R or y = 2x − 1 ∈ R
such that x + y = 2 ∨ 2x − y = 1 is True.
(e) F; Suppose there is x0 ∈ R such that yx0 = 1, ∀y ∈ R. Take y =
0, x0 × 0 = 0 = 1 which is False. This happens due to our wrong
assumption. So there is no x0 ∈ R such that x0 y = 1, ∀y ∈ R

9. (a) F; Take x = 2, y = 3, 22 + 2(3) = 10 < 10 which is False

(b) F; For x = 3, there is no y ∈ {1, 2, 3} such that 32 + 2y < 10.

3
 (c) T; Take x = 1, 12 + 2y < 10, ∀y ∈ {1, 2, 3} is true.
(d) T; Take x = 1, y = 2, 12 + 2(2) = 5 < 10 which is True.
10. (a) (∀x)(∃y)(xy ̸= x)
(b) (∃x)(∃y)(x ≥ y ∧ x < y)
(c) (∃x)(∀y)(x + y ̸= 0)
11. Define an open proposition C(x, y): x is a child of y.
(a) (∃x)(∃y) C(x, y)
(b) (∃x)(∀y) C(x, y)
(c) (∀x)(∃y) C(x, y)
(d) (∀x)(∀y) C(x, y)
12. (a) {1, 2, 3, 4, 6, 12}
(b) {−9, −8, −7, −6, −5, −4, −3, 3, 4, 5, 6, 7, 8, 9}
13. Maximum number of elements of B − A is 11 and minimum number of
elements of B − A is 1.
A − (A − B) = A ∩ (A ∩ B ′ )′
= A ∩ (A′ ∪ (B ′ )′ )
14. (a) = (A ∩ A′ ) ∪ (A ∩ B)
= ∅ ∩ (A ∩ B)
= (A ∩ B)
Therefore, A − (A − B) = A ∩ B
(A − C) − (B − C) = (A ∩ C ′ ) ∩ (B ∩ C ′ )′
= (A ∩ C ′ ) ∩ (B ′ ∪ (C ′ )′ )
= (A ∩ C ′ ) ∩ (B ′ ∪ C)
= [(A ∩ C ′ ) ∩ B ′ ] ∪ [(A ∩ C ′ ) ∩ C]
(b) = [A ∩ (C ′ ∩ B ′ )] ∪ [A ∩ (C ′ ∩ C)]
= [A ∩ (B ′ ∩ C ′ )] ∪ [A ∩ ∅]
= [(A ∩ B ′ ) ∩ C ′ ] ∪ ∅
= (A ∩ B ′ ) ∩ C ′
= (A − B) − C
15.
P(A) = {∅, {−1}, {0}, {1}, {2}, {−1, 0}, {−1, 1}, {−1, 2},
{0, 1}, {0, 2}, {1, 2}, {−1, 0, 1}, {−1, 0, 2}, {−1, 1, 2}, {0, 1, 2}, A}

4
16. (a) GCD: 12 ; LCM: 360
(b) GCD: 12 ; LCM: 5400
(c) GCD: 45 ; LCM: 900
(d) GCD: 28 ; LCM: 12936

17. (a) Base Case (n = 1): For n = 1, the left-hand side is:

1 = 21+1 − 1 = 22 − 1 = 4 − 1 = 3.

Since 1 = 3, the base case holds.

Inductive Hypothesis: Assume that for some k ≥ 1, 1 + 2 +
22 + · · · + 2k = 2k+1 − 1.
Inductive Step: We need to prove that 1 + 2 + 22 + · · · + 2k+1 =
2k+2 − 1, given the inductive hypothesis.

z }| {
1 + 2 + 22 + · · · + 2k+1 = 1 + 2 + 22 + · · · + 2k +2k+1
= (2k+1 − 1) + 2k+1 by Inductive hypothesis
= 2 × 2k+1 − 1
= 2k+2 − 1

Therefore,
1 + 2 + 22 + · · · + 2k+1 = 2k+2 − 1.
By the Principle of Mathematical Induction, we conclude that
1 + 2 + 22 + · · · + 2n = 2n+1 − 1 for all n ≥ 1.
(b) Base Case (n = 1): For n = 1, we have

22×1 − 1 = 22 − 1 = 4 − 1 = 3.

Since 3 is divisible by 3, the base case holds.

Inductive Hypothesis: Assume that for some k ≥ 1, 22k − 1 is
divisible by 3, i.e., 22k − 1 = 3m for some integer m.
Inductive Step: We need to prove that 22(k+1) − 1 is divisible by
3, given the inductive hypothesis.

5
 Now, consider 22(k+1) − 1:

22(k+1) − 1 =22k+2 − 1
=4 × 22k − 1
=4 × (3m + 1) − 1 by Inductive hypothesis
=12m + 4 − 1
=12m + 3
=3(4m + 1)
=3p, where p = 4m + 1 ∈ Z

This implies that 22(k+1) − 1 is divisible by 3.

Therefore, by PMI 22n − 1 is divisible by 3, for all n ∈ N
(c) Base Case (n = 2): For n = 2, we have

23 − 2 = 8 − 2 = 6.

Since 6 is divisible by 3, the base case holds.

Inductive Hypothesis: Assume that for some k ≥ 2, k 3 − k is
divisible by 3, i.e., k 3 − k = 3m for some integer m.
Inductive Step: We need to prove that (k + 1)3 − (k + 1) is
divisible by 3, given the inductive hypothesis.
Now, consider (k + 1)3 − (k + 1):

(k + 1)3 − (k + 1) =k 3 + 3k 2 + 3k + 1 − (k + 1)
=k 3 + 3k 2 + 3k + 1 − k − 1
=(k 3 − k) + 3k 2 + 3k
=3m + 3(k 2 + k), inductive hypothesis
=3(m + k 2 + k)
=3r, where r = m + k 2 + k ∈ Z

This implies that (k + 1)3 − (k + 1) is divisible by 3.

By the Principle of Mathematical Induction, we conclude that
n3 − n is divisible by 3 for all n ≥ 2.
(d) Base Case (n = 3): For n = 3, we have

2 × 3 + 1 = 7 < 23 = 8.

Since 7 < 8, the base case holds.

6
 Inductive Hypothesis: Assume that for some k ≥ 3, 2k + 1 <
2k .
Inductive Step: We need to prove that 2(k + 1) + 1 < 2k+1 ,
given the inductive hypothesis.

2(k + 1) + 1 = (2k + 1) + 2 < 2k + 2 Inductive hypothesis

k k
<2 +2 , since 2 < 2k for k ≥ 3
= 2 × 2k
= 2k+1

Hence,
2(k + 1) + 1 < 2k+1 .
By the Principle of Mathematical Induction, we conclude that
2n + 1 < 2n for all n ≥ 3.

18. (a) set of lbs= {x ∈ R | x ≤ 0}; glb = 0

set of ubs= {x ∈ R | x ≥ 1}; lub = 1

(b) set of lbs= {x ∈ R | x ≤ 0}; glb = 0

set of ubs= {x ∈ R | x ≥ 1}; lub = 1

(c) set of lbs= {x ∈ R | x ≤ − 21 }; glb = - 12

2 2
set of ubs= {x ∈ R | x ≥ 15 }; lub = 15

19. (a) 16 − 7i
(b) 23 − 7i
(c) −18i
(d) 1 − i
14 5
20. Re(z) = 13
; Im(z) = 13

21. (a) 32i

(b) 230
(c) −250
√ √
3 3
22. (a) cube roots of z = 1 are: 1, − 12 + i 2
and − 12 − i 2
√ √
3 3
(b) cube roots of z = i are: 2
+ i 21 , − 2
+ i 12 and −i

7
 √ √ √
3 3 3
(c) sixth
√
roots of z = −1 are: 2
+ 12 i, i, − 2
+ 12 i, − 2
− 12 i, −i and
3
2
− 12 i
√ i 11π √ 19π
(d) The cube roots of z = −2 + 2i are: 1 + i, 2e 12 and 2ei 12

23. (a) The solutions are −5i and 5i.

(b) The solutions are 1 + i, −1 − i, 1 − i and −1 + i