Science:Math Exam Resources/Courses/MATH220/December 2011/Question 01 (f)/Solution 1

Strong mathematical induction is a method to prove a statement S(n) is true for all natural numbers n. It is given by the following.

Suppose that for every natural number n, that we have the implication

$(\mathrm{\forall }k<n,S(k))\Rightarrow S(n)$

Then for every natural number n, the statement S(n) is true.