Today, we will learn about mathematical induction. We usually use induction to prove a certain statement to be correct for all natural numbers.
Let us use P(n) to denote a statement that involves a natural number n. To prove that P(n) is correct for all natural number n, an induction proof will have the following steps
Step 1: is called the initial step. We will prove that the statement P(n) is correct for the case n=0.
Step 2: is called the induction step. This is the most important step. In this step,
- we assume that for any 0 \leq n \leq k, the statement P(n) is correct;
- with this assumption, we will prove that the statement P(n) is also correct for the case n=k+1.
With these two steps, by the mathematical induction principle, we conclude that the statement P(n) must be correct for all natural number n.