Mathematical induction for sums and divisibility

What this note covers

1. The structure of a proof by mathematical induction
2. Proving summation formulae: the sum of the first n positive integers
3. Proving the sum of the first n squares
4. Proving divisibility results by mathematical induction
5. A harder divisibility proof: 6 | n(n+1)(n+2)
6. Comparing summation and divisibility proofs: key structural differences
7. Examination technique and common presentation pitfalls

7 sections · 12 key terms & formulas · 6 common mistakes