Prove by Mathematical Induction that for all positive integers :
Every proof by Mathematical Induction has three parts:
| Step | Name | What to do |
|---|---|---|
| 1 | Base Case | Verify the statement is true for |
| 2 | Inductive Hypothesis | Assume the statement is true for |
| 3 | Inductive Step | Prove the statement is true for |
Left-Hand Side (LHS):
Right-Hand Side (RHS):
Since LHS RHS , the statement holds for . ✓
Assume the statement is true for , i.e., assume:
We need to show:
Starting from the LHS:
Factor out :
This is exactly the RHS for . ✓
Since the statement is true for (base case), and whenever it is true for it is also true for (inductive step), by the Principle of Mathematical Induction the statement is true for all positive integers .