MATH140 Final Review Questions Answers
MATH140 Final Review Questions Answers
COUNTING
1) How many lists of length 5 can be made from the letters S,T, U, V,W,X, Y,Z, with
(i)repetition is allowed
(ii)repetition is not allowed
(iii) repetition is not allowed and the list must contain S
(iv) repetition is allowed and the list must contain S
Answer:
(i) 85
(ii) 8 · 7 · 6 · 5 · 4
(iii) 7 · 6 · 5 · 4 + 7 · 6 · 5 · 4 + 7 · 6 · 5 · 4 + 7 · 6 · 5 · 4 + 7 · 6 · 5 · 4
(iv) 85 − 75
2) If you toss a coin, roll a six-sided die, and pick a card from a 52-card deck.
(i) How many total outcomes are there?
(ii) How many outcomes where the dice lands on an odd number?
(iii) How many outcomes are there where the dice lands on an odd number and the card is a king?
Answer:
(i) 2 · 6 · 52
(ii) 2 · 3 · 52
(iii) 2 · 3 · 4
3) A student ID is a list of length 8 where the first 4 entries are letters and the last 4 entries
are digits (0-9). How many possible student IDs are there?
Answer: 264 · 104
5) How many
3-element subsets does the set a, b, c, d, e, f, g have?
7
Answer: = 35
3
3 10
12) What
is the coefficient of x in the expansion of (5 + x) ?
10
Answer: · 57
3
7 20
13) What
is the coefficient of x in the expansion of (3 + x) ?
20
Answer: · 313
7
DIRECT PROOFS
14) Show using a direct proof: Prop. If n is an odd integer, then n3 + n is even.
Answer: Proof.
Suppose n is odd, then n = 2k + 1, for some k ∈ Z.
Then n3 + n = (2k + 1)3 + (2k + 1) = 8k 3 + 12k 2 + 6k + 1 + 2k + 1 = 8k 3 + 12k 2 + 8k + 2 =
2(4k 3 + 6k 2 + 3k + 1).
So n3 + n = 2b, where b = 4k 3 + 6k 2 + 3k + 1 is an integer.
By definition, n3 + n must even.
15) Show using a direct proof: Prop. The sum of two odd integers is even.
Answer: Proof.
Suppose m and n are odd integers.
Then m = 2k + 1 and n = 2l + 1, for some k, l ∈ Z.
Then, m + n = (2k + 1) + (2l + 1) = 2k + 2k + 2 = 2(k + l + 1).
So, m + n = 2b, for b = k + l + 1 an integer.
By definition, the sum of two odd integers, m + n, is even.
17) Show using a direct proof: Prop. Suppose n, a, b ∈ Z, if n|a and n|(a + b), then n|b.
Answer: Proof.
Suppose n|a and n|(a + b).
By definition, a = nk and (a + b) = nl, for k, l ∈ Z.
We have a + b = nl ⇒ nk + b = nl ⇒ b = nl − nk = n(l − k).
So, b = nx, where x = l − k an integer.
By definition, n|b.
18) Show using a direct proof: Prop. Suppose a, b, c ∈ Z, if a2 |b and b3 |c, then a6 |c.
Answer: Proof.
Suppose a2 |b and b3 |c.
By definition, b = a2 k and c = b3 l, for some k, l ∈ Z.
Then, we have c = b3 l = (a2 k)3 l = a6 k 3 l = a6 (k 3 l).
So, c = a6 m for m = k 3 l an integer.
By definition, we have a6 |c.
5x4 + 6x2 − 1
19) Show directly that the function f (x) = is an even function.
x2 + 1
5(−x)4 + 6(−x)2 − 1 5x4 + 6x2 − 1
Answer: f (−x) = = = f (x). Since f (−x) = f (x), then f (x)
(−x)2 + 1 x2 + 1
is an even function.
20) Show directly that the function g(x) = 4x5 − 3x3 + x is an odd function.
Answer: g(−x) = 4(−x)5 − 3(−x)3 + (−x) = −4x5 + 3x3 − x = −(4x5 − 3x3 + x) = −g(x). Since
g(−x) = −g(x), then g(x) is an odd function.
21) Show using a direct proof: Prop. If n ∈ Z, then n3 + 5n + 3 is odd. (Hint: use cases.)
Answer: Proof.
Case 1: Suppose n is even.
Then n = 2k, for some k ∈ Z.
We have n3 + 5n + 3 = (2k)3 + 5(2k) + 3 = 8k 3 + 10k + 3 = 8k 3 + 10k + 2 + 1 = 2(4k 3 + 5k + 1) + 1.
So, n3 + 5n + 3 = 2b + 1, for b = 4k 3 + 5k + 1 an integer.
By definition n3 + 5n + 3 is odd.
Case 2: Suppose n is odd.
Then n = 2m + 1 for some m ∈ Z.
We have n3 + 5n + 3 = (2m + 1)3 + 5(2m + 1) + 3 = 8m3 + 12m2 + 6m + 1 + 10m + 5 + 3 =
8m3 + 12m2 + 16m + 9 = 8m3 + 12m2 + 16m + 9 + 1 = 2(4m3 + 6m2 + 8m + 4) + 1.
So, n3 + 5n + 3 = 2a + 1 for a = 4m3 + 6m2 + 8m + 4 an integer.
22) Show using a direct proof: Prop. If n ∈ Z, then n2 is of the form 4k or 4k + 1. (Hint: use
cases.)
Answer: Proof.
Case 1: Suppose n is even.
By definition, n = 2a, for some a ∈ Z.
Then, n2 = (2a)2 = 4a2 .
So, n2 is of the form 4k, where k = a2 , an integer.
Case 2: Suppose n is odd.
By definition, n = 2b + 1, for some b ∈ Z.
Then, n2 = (2b + 1)2 = 4b2 + 4b + 1 = 4(b2 + b) + 1.
So, n2 is of the form 4k + 1, where k = b2 + b an integer.
Since in both cases, if n is even or n is odd, the number n2 is either of the form 4k or 4k + 1, then
for all integers n, the number n2 is of the form 4k or 4k + 1.
CONTRAPOSITIVE PROOFS
23) Prove by contrapositive: Prop. Suppose n ∈ Z, if 2 - n, then n is odd.
Answer: Proof.
Suppose n is not odd.
Then n must be even, and so n = 2k, for some k ∈ Z.
Then, by definition, 2|n .
So, it is not the case that 2 - n.
27) “If f (x) is continuous at x = a, then f (x) is defined at x = a.” Show, using the contrapos-
1
itive of the statement above, that f (x) = is not continuous at x = 2.
x−2
Answer: Since f (x) is not defined at x = 2, then by the above statement it is not continuous at
x = 2.
PROOF BY CONTRADICTION
28) Prove by contradiction: Prop. Suppose n ∈ Z, if n3 + 5 is odd, then n is even.
Answer: Proof.
Suppose n3 + 5 is odd and n is not even.
Then, n must be odd, and n = 2k + 1, for some k ∈ Z.
Then, n3 + 5 = (2k + 1)3 + 5 = 8k 3 + 12k 2 + 6k + 1 + 5 = 8k 3 + 12k 2 + 6k + 6 = 2(4k 3 + 6k 2 + 3k + 3).
So, n3 + 5 = 2b, with b = 4k 3 + 6k 2 + 3k + 3 an integer.
By definition, n3 + 5 is even.
This is a contradiction, since we assumed that n3 + 5 is odd.
31) Prove by contradiction: Prop. Suppose x, y ∈ R If x + y > 5 then either x > 2 or y > 3.
Answer: Proof. Suppose x + y > 5 and it is not the case that x > 2 or y > 3.
Then, it must be the case that x ≤ 2 and y ≤ 3.
We have x + y ≤ 2 + 3 = 5.
PROOF BY INDUCTION
33) Suppose you want to show the following statement using induction: “ If n ∈ N and n ≥ 2,
then P (n) : n2 ≥ 2n”. What is the statement P (n + 1) in this case?
Answer: P (n + 1) : (n + 1)2 ≥ 2(n + 1)
34) Prove by induction: Prop. The sum of the first n even integers is n(n + 1)
Answer: Proof.
(1) Basis step: for n = 1, the first even integer is 2, so we have 2 = 1(1 + 1), which is true.
(2) Inductive step: we will assume that P (n) : 2 + 4 + 6 + · · · 2n = n(n + 1) is true and use that to
show P (n + 1) : 2 + 4 + 6 + · · · + 2(n + 1) = (n + 1)((n + 1) + 1) is true.
We have 2 + 4 + 6 + · · · + 2(n + 1) = 2 + 4 + 6 + · · · + 2n + 2(n + 1) = n(n + 1) + 2(n + 1) =
(n + 2)(n + 1) = (n + 1)((n + 1) + 1)
Thus, P (n + 1) is true.
4n − 1
35) Prove by induction: Prop. 1 + 4 + 42 + · · · + 4n−1 =
3
41 − 1
Answer: Proof. (1) Basis step: for n = 1, we have 1 = , which is true.
3
4n − 1
(2) Inductive step: we will assume that P (n) : 1 + 4 + 42 + · · · + 4n−1 = is true, and use that
3
n+1
4 −1
to show that P (n + 1) : 1 + 4 + 42 + · · · + 4n = is true.
3
4n − 1 4n − 1 3 · 4n
We have 1 + 4 + 42 + · · · + 4n = 1 + 4 + 42 + · · · + 4n−1 + 4n = + 4n = + =
3 3 3
n n n n+1
4 −1+3·4 4·4 −1 4 −1
= = .
3 3 3
Thus, P (n + 1) is true.
MORE ON PROOFS
36) Consider the following statement: “If n is odd, then 8|(n2 − 1)”. Classify the following
first lines of different proofs, as the beginning of a direct, contrapositive, or contradiction proof:
(i) Suppose 8 - (n2 − 1)...
(ii) Suppose n is odd...
37) Consider the following statement: “If n ∈ N and 2n − 1 is prime, then n is prime”. Classify
the following first lines of different proofs, as the beginning of a direct, contrapositive, or contra-
diction proof:
(i) Suppose 2n − 1 is prime and n is not prime...
(ii) Suppose n is not prime, ...
(iii) Suppose 2n − 1 is prime, ...
Answer:
(i) Contradiction
(ii) Contrapositive
(iii) Direct
39) Suppose one is asked to prove the statement “Suppose n ∈ Z. If n is odd, then n2 is odd.
Is it correct to prove this by stating that 12 = 1, 32 = 9, and 52 = 25 are all odd? Why or why not?
Answer: No, one needs to prove this statement for all integers n, so it is enough to show that the
statement is true for a few numbers.
40) Consider the statement “If f (x) is differentiable at x = a, then f (x) is continuous at
x = a”. Is the following correct application of that statement: “f (x) = |x| is not differentiable at
x = 0 because f (x) is not continuous at x = 0” ?
Answer: No. Not differentiable does not imply not continuous. Rather, not continuous implies
not differentiable. Also, f (x) = |x| is continuous at x = 0.