2.

Mathematical induction
Prove the following relations by mathematical induction.
n(n + 1)
2.1. 1 + 2 + · · · + n = ∀n ∈ N;
2
n(n + 1)(2n + 1)
2.2. 12 + 22 + · · · + n2 = ∀n ∈ N;
6
 2
3 3 3 n(n + 1)
2.3. 1 + 2 + · · · + n = ∀n ∈ N;
2
2.4. 1 + 3 + 5 + · · · + (2n − 1) = n2 ∀n ∈ N;
n(4n2 − 1)
2.5. 12 + 32 + 52 + · · · + (2n − 1)2 = ∀n ∈ N;
3
n(n + 1)(n + 2)
2.6. 1 · 2 + 2 · 3 + · · · + n(n + 1) = ∀n ∈ N;
3
1 1 1 n
2.7. + + ··· + = ∀n ∈ N;
1·2 2·3 n(n + 1) n+1
2.8. 1 · 4 + 2 · 7 + · · · + n(3n + 1) = n(n + 1)2 ∀n ∈ N;
    
1 1 1 n+2
2.9. 1 − 1− ··· 1 − 2
= ∀n ∈ N;
4 9 (n + 1) 2n + 2
2.10. 1 · 1! + 2 · 2! + · · · + n · n! = (n + 1)! − 1 ∀n ∈ N;
3
2.11. 6|(n − n) ∀n ∈ N;
3
2.12. 6|(n + 5n) ∀n ∈ N;
4n+1
2.13. 5|(2 + 3) ∀n ∈ N;
3
2.14. 3|(n + 5n + 6) ∀n ∈ N;
n n+2
2.15. 9|(10 + 3 · 4 + 5) ∀n ∈ N;
2.16. 4|(7n + 10n − 5) ∀n ∈ N;
n3 n5 7n
2.17. + + is integer for all n ∈ N;
3 5 15
2.18. (n + 1)! > 2n+3 , if n ≥ 5, n ∈ N;
n
X 1 √
2.19. (*) √ ≥ 2( n + 1 − 1) ∀n ∈ N;
k=1
k
 
2n
2.20. < 4n−1 , if n ≥ 5, n ∈ N;
n
n
X 1 1
2.21. (*) 2
≤2− ∀n ∈ N;
k=1
k n
2.22. (*) n3 < 2n+1 , if n > 8, n ∈ N;
n
√ X 1 √
2.23. (*) n ≤ √ <2 n ∀n ∈ N.
k=1
k
2.24. Let us assume that n ≥ 4 elderly women all know a different gossip. Furthermore, if any
two of them talk on the phone, they share all the gossips they know. Prove by induction that
it’s possible for all of them to get to know every gossip via 2n − 4 phone calls.