Prove by Mathematical Induction:
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 must prove the statement holds for , i.e., we need to show:
Starting from the LHS:
Factor out :
This is exactly the RHS for . ✓
Since the base case holds for , and the truth of the statement for implies its truth for , by the Principle of Mathematical Induction, the statement is true for all positive integers .
| Step | Description |
|---|---|
| Base Case | Verify the statement is true for the smallest value (usually ) |
| Inductive Hypothesis | Assume the statement is true for |
| Inductive Step | Using the hypothesis, prove the statement is true for |
| Conclusion | State that the result holds for all |