Module 9 Lesson 3 Quiz
1. If the nth term is nn+1, then the (n+1)st term is:
A. nn+1+2
B. nn+1+1
C. (n+1)n+1+1
D. (n+1)n+1+2
2. We assume the nth term and prove the (n+1)st term to:
A. Show the arbitrariness of the terms (it will work everywhere)
B. Show our mastery of addition
C. Make our argument longer
D. Find a starting point
3. Mathematical induction is:
A. A method for describing electric current
B. Acceptance into a fraternity
C. A method of proving statements
D. A theory of Sophocles
4. When proving something by mathematical induction, the first step is to:
A. Assume that it works for n=1
B. Prove that it works for n=1
C. Assume that it works for n.
D. Prove that is works for n+1
5. When proving something by mathematical induction, the second step is to:
A. Assume that it works for n=1
B. Prove that it works for n=1
C. Assume that it works for n.
D. Prove that it works for n+1
5
6. If the nth term is 𝑛(𝑛+1) , then the (n+1)st is:
A.
B.
C.
D.
5
(𝑛+1)(𝑛+2)
5
(𝑛)(𝑛+2)
5
+1
(𝑛)(𝑛+1)
5
(𝑛)(𝑛+1)
𝑛
7. If the nth term is 2 (3𝑛 − 1) , then the (n+1)st is:
A.
B.
𝑛+1
2
𝑛+1
2
(3𝑛 − 1)
(3𝑛)
C.
D.
𝑛+1
2
𝑛+1
2
(3𝑛 + 2)
(3𝑛 + 1)
8. We use mathematical induction to prove things when:
A. We have infinitely many cases
B. We have two cases
C. We use a variable ‘n’
D. We can’t use two columns
9. Mathematical induction is the only method of proving statements.
A. True
B. False
10. If we can’t show that a statement works for n=1, then:
A. It must be false
B. Mathematical induction is not the best way to proceed
C. We continue with induction anyway
D. We state that it must be a contradiction
Answers: 1.C 2.A 3.C 4.B 5.C 6.A 7.C 8.A 9.B 10.B