The principle of mathematical induction is stated as follows:

If a given statement Sn concerning a positive integer n is true for n = 1, and if the truth of Sn for n = k,
where k is a positive integer, implies that Sn is true for n = k + 1, then Sn is true for every positive integer
n.

The premise behind this principle is self-intuitive. If a particular statement Sn (normally a mathematical
equation or inequality involving the variable n) is true for n = 1, and it can also be proven that Sn being
true implies that Sn + 1 is also true, then the statement Sn is true for n = 1 + 1 = 2. Similarly, Sn is true for
n = 2 + 1 = 3, n = 3 + 1 = 4, and so on for all positive integers.

It should be noted that the principle of mathematical induction can be extended to include whole
numbers by simply proving Sn to be true for

n = 0. Then, if Sn being true implies that Sn + 1 is true, Sn will be true for n = 0 + 1 = 1, n = 1 + 1 = 2 and
so on for all positive integers. Thus, Sn will be true for all whole numbers (the set of positive numbers
plus zero).