Module 2 Chapter 2 Mathematical Induction

Supplementary Exercise
By mathematical induction, prove that the following propositions are true for all positive
integers n. (1 9)
n(7 n 5)
1 8 15 ... (7 n 6)
2
1.
2.

2 8 32 ... 2 4

n 1

n 12

3.

1
1
1
n2 2

...

5 7 7 9
(2n 3)( 2n 5) 2n 5 5

4.

23n 1 is divisible by 11.

5.

8 2 n 1 is divisible by 63.

6.

10 n 3n is divisible by 7.

7.

2n 3 n is divisible by 3.

8.

n 3 4n 9 is divisible by 3.

9.

n( n 1)( n 2)(3n 1) is divisible by 12.

10. (a) By mathematical induction, prove that

n(n 1)( 4n 5)
1 3 2 5 3 7 ... n(2n 1)
6
for all positive integers n.
(b) Hence, find the value of 20 41 21 43 22 45 ... 50 101 .
11. Let Tn n(n 1) for any positive integer n.
By mathematical induction, prove that
1
T1 T2 T3 ... Tn (n 3 3n 2 2n)
3
for all positive integers n.