

1. 
If the k term of S_{k} is 4 + 2k, find the (k + 1) term. 


A. 
k + 1 
B. 
6 + 2k 


C. 
8 + 2k 
D. 
2k 


Hint 


2. 
Which of the following is not true about mathematical induction? 


A. 
The first possible case is always n = 1. 


B. 
It can be used to prove . 


C. 
Since S_{n} is valid for n = 1, it is valid for n = 2. Since it is valid for n = 2, it is valid for n = 3, and so on, indefinitely. 


D. 
Mathematical induction depends on a recursive process. 


Hint 


3. 
Which statement is not true? 


A. 
7^{n} + 2^{n} is divisible by 9 for all positive integral values of n. 


B. 
6^{n}  1 is divisible by 5 for all positive integral values of n. 


C. 
7^{n}  2^{n} is divisible by 5 for all positive integral values of n. 


D. 
5^{n}  1 is divisible by 4 for all positive integral values of n. 


Hint 


4. 
Which statement would be most logically proven using mathematical induction. 


A. 
Every polynomial has at least one complex root. 


B. 
The series converges. 


C. 
When two parallel lines are cut by a transversal, opposite interior angles are congruent. 


D. 
for all integers n 


Hint 


5. 
If , which statement verifies that S_{n} is valid for n = 1? 


A. 



B. 



C. 



D. 



Hint 

