Math 230-01 (Ellis) Spring 2009 Quiz 2 Name:

Instructions. Clearly circle the correct answer. Time limit is exactly 20 minutes.

1. Suppose that P (n) is the statement n + 1 = n + 2. What is wrong with the following “proof” that the
statement P (n) is true for all nonnegative integers n?
You assume that P (k) is true for some nonnegative integer k; that is, that k + 1 = k + 2.
Then you add 1 to both sides of this equation to obtain k + 2 = k + 3; therefore P (k + 1) is
true. By the principal of mathematical induction, P (n) is true for all nonnegative integers
n.

(a) There is nothing wrong with this proof.

(b) The proof is incorrect because the statement used in the inductive hypothesis is incorrect.
(c) The proof is incorrect because there is no basis step.
(d) The proof is incorrect because you cannot add 1 to both sides of the equation in the inductive
step.

2. Suppose you want to use mathematical induction to prove that

n
X
2i = 2n+1 − 1
i=0

for all positive integers n. Which of these is the correct implication P (k) → P (k + 1) to be used in the
inductive step?
X k k+1
X
i
(a) 2 → 2i
i=0 i=0

(b) 2k+1 − 1 → 2k+2 − 1

k
X k+1
X
(c) 2i = 2k+1 − 1 → 2i = 2k+2 − 1
i=0 i=0

k
X k+1
X
(d) 2i = 2k+1 − 1 → 2i = 2k+1 − 1 + 2k+1
i=0 i=0

3. The “Tribonacci” number g(n) is defined by g(1) = 1, g(2) = 1, g(3) = 2, and g(n) = g(n − 1) + g(n −
2) + g(n − 3) for all n ≥ 4. What is the Tribonacci number g(8)?
(a) 21
(b) 44
(c) 24
(d) 34
(e) none of these

4. What is the general formula for the function defined recursively by f (0) = 0, f (1) = 1, and for all
n ≥ 1, f (n + 1) = f (n) + 2n + 1?
(a) f (n) = n!
(b) f (n) = n2
(c) f (n) = 2n + 1
(d) f (n) = 2n √
(e) f (n) = (φ − (1 − φ)n )/ 5, where φ is the golden ratio
(f ) none of these

(NEXT PAGE)
5. Let P (n) be the statement “you can make n cents postage using 3-cent and 5-cent stamps.” Suppose
you want to use the Principle of Mathematical induction to show that P (n) is true for all n ≥ 8.
You begin by proving P (8) by selecting one 3-cent and one 5-cent stamp. Which of the following will
show that the implication P (k) → P (k + 1) in the inductive step is true for all k ≥ 8?
(a) Take the stamps used to make k cents postage and add a 3-cent stamp.
(b) Take the stamps that are used to make k cents postage and add a 5-cent stamp.
(c) Take the stamps that are used to make k cents postage, remove a 5-cent stamp, and add a 3-cent
stamp.
(d) Take the stamps that are used to make k cents postage, remove three 3-cent stamps and add two
5-cent stamps.
(e) None of these.

2
6. Suppose f (n) has the recursive definition f (n) = + 3 and you know that f (3) = 5. What is
f (n − 1)
the value f (1)?
(a) 3/2
(b) 1/3
(c) −6
(d) −1
(e) none of these

7. Which of the following is a valid recursive definition of a function f : N → Z? (Recall that N =

{0, 1, 2, · · · }.)
(a) pf (n) = 2f (n − 1) + 5 for all n ≥ 1
f (0) = 0, f (1) = 1, and
(b) f (0) = 1, and f (n) = f (n − 1) + 5 for all n ≥ 1
(c) f (0) = 1, f (1) = 2, and f (n) = f (n − 1) · f (n − 2) for all n ≥ 2
(d) f (0) = 1, and f (n) = 3f (n − 2) for all n ≥ 1

8. Which of the following steps would NOT prove that a given statement P (n) is true for all nonnegative
integers n?
(a) Pick a positive integer B. Show that P (0), P (1), . . . , P (B − 1) are all true. Then assume that
P (k) is true where k is a nonnegative integer and prove that P (k + B) is true.
(b) First show that P (0) is true. Then assume that P (k) is true where k is a nonnegative integer and
prove that P (k + 1) is true.
(c) First show that P (0) is true. Then prove that P (k) → P (k + 1) is true for all positive integers k.
(d) First show that P (0) and P (1) are true. Then prove that the following is true for all nonnegative
integers k: if P (k) is true, then P (k + 2) is true.

IIT Menger Day 2009 is this MONDAY April 20.

12:50-1:40pm E1 123: Prof. Richard Durrett speaks to the math club
4:30-5:30pm MTCC McCloska Ballroom: “Truth Is Stranger than Fiction: A Look at Some Improba-
bilities”, Prof. Richard Durrett
Math 230-01 (Ellis) Spring 2009 Quiz 2 Name:

Instructions. Clearly circle the correct answer. Time limit is exactly 20 minutes.

1. Suppose you want to use mathematical induction to prove that

n
X
2i = 2n+1 − 1
i=0

for all positive integers n. Which of these is the correct implication P (k) → P (k + 1) to be used in the
inductive step?

k
X k+1
X
i k+1
(a) 2 =2 −1→ 2i = 2k+2 − 1
i=0 i=0

k
X k+1
X
(b) 2i = 2k+1 − 1 → 2i = 2k+1 − 1 + 2k+1
i=0 i=0
k
X k+1
X
(c) 2i → 2i
i=0 i=0
k+1
(d) 2 − 1 → 2k+2 − 1

2. Let P (n) be the statement “you can make n cents postage using 3-cent and 5-cent stamps.” Suppose
you want to use the Principle of Mathematical induction to show that P (n) is true for all n ≥ 8.
You begin by proving P (8) by selecting one 3-cent and one 5-cent stamp. Which of the following will
show that the implication P (k) → P (k + 1) in the inductive step is true for all k ≥ 8?
(a) Take the stamps that are used to make k cents postage, remove a 5-cent stamp, and add a 3-cent
stamp.
(b) Take the stamps that are used to make k cents postage, remove three 3-cent stamps and add two
5-cent stamps.
(c) Take the stamps used to make k cents postage and add a 3-cent stamp.
(d) Take the stamps that are used to make k cents postage and add a 5-cent stamp.
(e) None of these.
2
3. Suppose f (n) has the recursive definition f (n) = + 3 and you know that f (3) = 5. What is
f (n − 1)
the value f (1)?
(a) −6
(b) −1
(c) 3/2
(d) 1/3
(e) none of these

4. Which of the following steps would NOT prove that a given statement P (n) is true for all nonnegative
integers n?
(a) First show that P (0) is true. Then prove that P (k) → P (k + 1) is true for all positive integers k.
(b) First show that P (0) and P (1) are true. Then prove that the following is true for all nonnegative
integers k: if P (k) is true, then P (k + 2) is true.
(c) Pick a positive integer B. Show that P (0), P (1), . . . , P (B − 1) are all true. Then assume that
P (k) is true where k is a nonnegative integer and prove that P (k + B) is true.
(d) First show that P (0) is true. Then assume that P (k) is true where k is a nonnegative integer and
prove that P (k + 1) is true.

(NEXT PAGE)
5. What is the general formula for the function defined recursively by f (0) = 0, f (1) = 1, and for all
n ≥ 1, f (n + 1) = f (n) + 2n + 1?
(a) f (n) = 2n √
(b) f (n) = (φ − (1 − φ)n )/ 5, where φ is the golden ratio
(c) f (n) = n!
(d) f (n) = n2
(e) f (n) = 2n + 1
(f ) none of these

6. Suppose that P (n) is the statement n + 1 = n + 2. What is wrong with the following “proof” that the
statement P (n) is true for all nonnegative integers n?
You assume that P (k) is true for some nonnegative integer k; that is, that k + 1 = k + 2.
Then you add 1 to both sides of this equation to obtain k + 2 = k + 3; therefore P (k + 1) is
true. By the principal of mathematical induction, P (n) is true for all nonnegative integers
n.

(a) The proof is incorrect because there is no basis step.

(b) The proof is incorrect because you cannot add 1 to both sides of the equation in the inductive
step.
(c) There is nothing wrong with this proof.
(d) The proof is incorrect because the statement used in the inductive hypothesis is incorrect.

7. Which of the following is a valid recursive definition of a function f : N → Z? (Recall that N =

{0, 1, 2, · · · }.)
(a) f (0) = 1, f (1) = 2, and f (n) = f (n − 1) · f (n − 2) for all n ≥ 2
(b) f (0) = 1, and f (n) = 3f (n − 2) for all n ≥ 1
(c) pf (n) = 2f (n − 1) + 5 for all n ≥ 1
f (0) = 0, f (1) = 1, and
(d) f (0) = 1, and f (n) = f (n − 1) + 5 for all n ≥ 1

8. The “Tribonacci” number g(n) is defined by g(1) = 1, g(2) = 1, g(3) = 2, and g(n) = g(n − 1) + g(n −
2) + g(n − 3) for all n ≥ 4. What is the Tribonacci number g(8)?
(a) 24
(b) 34
(c) 21
(d) 44
(e) none of these

IIT Menger Day 2009 is this MONDAY April 20.

12:50-1:40pm E1 123: Prof. Richard Durrett speaks to the math club
4:30-5:30pm MTCC McCloska Ballroom: “Truth Is Stranger than Fiction: A Look at Some Improba-
bilities”, Prof. Richard Durrett