Home page for accesible maths Math 101 Chapter 1: Sequences and Series

Style control - access keys in brackets

Font (2 3) - + Letter spacing (4 5) - + Word spacing (6 7) - + Line spacing (8 9) - +

1.15 Principle of induction

Principle of induction

Let P(n)P(n)\, be a statement concerning the positive integer nn\,. Suppose that:

(i) (Basis of induction) P(1)P(1)\, is true;

(ii) (Induction step) If P(n)P(n)\, is true for some nn\,, then P(n+1)P(n+1)\, is also true.

Then P(n)P(n)\, is true for all positive integers nn\,.

Remarks. (i) The basis of induction checks that we can start the argument with a true statement; and

(ii) The induction step asserts that, having reached some point, we can always take one further step ahead.