Professional Documents
Culture Documents
A B (A = B) A = (B)
T T F F
T F T T
F T F T
F F F T
(b) Justify whether the compound statements (A = B) and A = (B) are logically equivalent.
[1 mark]
Soln. When A = F, B = T, we get that (A = B) is false, while A = (B) is true. Therefore the
statements are not logically equivalent.
Here is an incorrect proof of Statement 1. Determine the main flaw in the argument. [1 mark]
Attempted Proof. Suppose a is even. Then a2 is even, so both a2 + 3 and a2 + 7 are odd. Since 32 is even,
32 - ((a2 + 3)(a2 + 7)).
Soln. This attempt assumes that the conclusion is true. We cannot prove an implication starting from the
conclusion.
3. For each of the statements given below, either prove that it is true or provide a counterexample to show
that the statement is false.
1
4. Suppose b is an integer. Consider the following implication about b.
Statement 2. If for all k N, b - k, then b = 0.
n + (n + 1) + (n + 2) + + (2n 1) + 2n.
Complete the induction conclusion below to prove that for all n N, [3 marks]
2n
X 3 2
i= n +n .
2
i=n
2
Soln. Starting from the left side,
2(k+1)
X
i = (k + 1) + (k + 2) + + (2k + 1) + (2k + 2)
i=k+1
= [k + (k + 1) + . . . + (2k)] + [(2k + 1) + (2k + 2) k]
2k
X
= i + (3k + 3)
i=k
3 2
= k + k + 3(k + 1) using induction hypothesis
2
3
= (k + 1)(k + 2) by factoring (k + 1)
2
3h i
= (k + 1)2 + (k + 1) ,
2
which is the right side of the required equation when n = k + 1.
Therefore, by the Principle of Mathematical Induction, we are done.
3
7. Suppose S and T are two sets. Recall the definition
T S = {x T : x < S} .
(a) Express the negation of Statement 3 without using the word not or the symbol. [2 marks]
Soln. There exists x, y R such that x < y and for all z R, x z or z y.
(b) Prove Statement 3. [4 marks]
Soln. Let x, y R. Assume x < y.
x+y
Consider z = 2 . Note that z R.
x+y
Now, x = 2x
2 = 2 < 2 = z.
x+x
x+y y+y
Similarly, z = 2 < 2 = y. Hence x < z < y.
[Hints: 1. n is a prime if and only if all the positive divisors of n are 1 and n itself.
2. k3 + 1 = (k + 1)(k2 k + 1).]
Soln. Let n 3 be an integer. Assume. for the sake of contradiction, that there exists k N such that
n = k3 + 1 and n is a prime.
By the given hint, we may write n = (k + 1)(k2 k + 1). Note that both k + 1 and k2 k + 1 must be positive
integers, and as n can be written as their product, therefore either k + 1 = 1, or k2 k + 1 = 1.
However, k + 1 , 1 as k 1. This means that k2 k + 1 = 1 must be true. Therefore, k2 k = 0, so either
k = 0 or k = 1. However, as k N, k = 0 is not possible, so k = 1. In that case, n = k3 + 1 = 13 + 1 = 2 < 3
(contradiction).