Paper 1 · November 2010 · Series and Proof by Induction
An induction proof shows that is divisible by 9 for every positive integer . What does the inductive step assume?
Athe result holds for every positive integer n
Bthe result holds for n = 1 and for n = 2
C9 is a factor of 10^k for that value of k
Dthe result holds for one value n = k
Explanation
Induction assumes the statement for a single unnamed value , then uses that assumption to prove it for . Assuming it for every would be assuming the very thing to be proved.
Derived from ZIMSEC Further Mathematics 9187/1, November 2010, Q6