Mathematical Induction Math Example 2
Follow the full solution, then compare it with the other examples linked below.
Example 2
hardProve by induction: for all integers .
Solution
- 1 Base case (): and . Since , the base case holds.
- 2 Inductive hypothesis: Assume for some .
- 3 Inductive step: . Since , we have .
- 4 Therefore . The inequality holds for .
Answer
In the inductive step, we multiply both sides by and use the fact that to strengthen the bound. The base case starts at because the claim is false for .
About Mathematical Induction
Mathematical induction proves statements indexed by integers by verifying a base case and an inductive step.
Learn more about Mathematical Induction β