Chapter 2 Mathematical Induction Grade 12 Mathematics

MATHEMATICAL INDUCTION

1. Prove, by using the mathematical induction principle, that

2 · 1 + 2 · 2 + 2 · 3 + · · · + 2n = n2 + n

Solution
Let P (n) denote the statement

2 · 1 + 2 · 2 + 2 · 3 + · · · + 2n = n2 + n

(1) For n = 1,

L.H.S. = 2 · 1 = 2.
R.H.S. = 12 + 1 = 1 + 1 = 2.
L.H.S. = R.H.S.

The statement is true for n = 1.

(2) Assume that the statement is true for n = k, that is

2 · 1 + 2 · 2 + 2 · 3 + · · · + 2k = k 2 + k

We will show that the statement is true for n = k + 1, that is

2 · 1 + 2 · 2 + 2 · 3 + · · · + 2(k + 1) = (k + 1)2 + (k + 1)

It is proved that

2 · 1 + 2 · 2 + +2 · 3 · · · + 2(k + 1) = 2 · 1 + 2 · 2 + · · · + 2k + 2(k + 1)
= (k 2 + k) + 2(k + 1)
= k 2 + k + 2k + 2
= k 2 + 3k + 2
= k 2 + 2k + 1 + k + 1
= (k + 1)2 + (k + 1)

Therefore, the statement is true for n = k + 1.

(3) Hence, by principle of mathematical induction, the statement P (n) is true for
all natural numbers n.

1
Chapter 2 Mathematical Induction Grade 12 Mathematics

2. Prove, by using the mathematical induction principle, that

2 + 4 + 6 + · · · + 2n = n(n + 1)

for all natural numbers n.

Solution
Let P (n) denote the statement

2 + 4 + 6 + · · · + 2n = n(n + 1)

(1) For n = 1,

L.H.S. = 2.
R.H.S. = 1(1 + 1) = 1(2) = 2.
L.H.S. = R.H.S.

The statement is true for n = 1.

(2) Assume that the statement is true for n = k, that is

2 + 4 + 6 + · · · + 2k = k(k + 1)

We will show that the statement is true for n = k + 1, that is

2 + 4 + 6 + · · · + 2(k + 1) = (k + 1)(k + 2)

It is proved that

2 + 4 + 6 + · · · + 2(k + 1) = 2 + 4 + 6 + · · · + 2k + 2(k + 1)
= k(k + 1) + 2(k + 1)
= k 2 + k + 2k + 2
= k 2 + 3k + 2
= (k + 1)(k + 2)

Therefore, the statement is true for n = k + 1.

(3) Hence, by principle of mathematical induction, the statement P (n) is true for
all natural numbers n.

2
Chapter 2 Mathematical Induction Grade 12 Mathematics

3. Prove, by using the mathematical induction principle, that

2 4 6 2n 1
+ + + ··· + = n(n + 1)
5 5 5 5 5
for all natural numbers n.

Solution
Let P (n) denote the statement
2 4 6 2n 1
+ + + ··· + = n(n + 1)
5 5 5 5 5
(1) For n = 1,
2
L.H.S. =
5
1 2
R.H.S. = (1)(1 + 1) =
5 5
L.H.S. = R.H.S.

The statement is true for n = 1.

(2) Assume that the statement is true for n = k, that is
2 4 6 2k 1
+ + + ··· + = k(k + 1)
5 5 5 5 5
We will show that the statement is true for n = k + 1, that is
2 4 6 2(k + 1) 1
+ + + ··· + = (k + 1)(k + 2)
5 5 5 5 5
It is proved that
2 4 6 2(k + 1) 2 4 6 2k 2(k + 1)
+ + + ··· + = + + + ··· + +
5 5 5 5 5 5 5 5 5
1 2(k + 1)
= k(k + 1) +
5 5
2
k + k 2k + 2
= +
5 5
k 2 + 3k + 2
=
5
(k + 1)(k + 2)
=
5
1
= (k + 1)(k + 2)
5
Therefore, the statement is true for n = k + 1.
(3) Hence, by principle of mathematical induction, the statement P (n) is true for
all natural numbers n.

3
Chapter 2 Mathematical Induction Grade 12 Mathematics

4. Prove that ! "2 ! "n ! "n

1 1 1 1
+ + ··· + =1−
2 2 2 2
by using principle of mathematical induction for all natural numbers.

Solution
Let P (n) be the statement
! "2 ! "n ! "n
1 1 1 1
+ + ··· + =1−
2 2 2 2
(1) For n = 1,
1
L.H.S. = .
2
! "1
1 1 1
R.H.S. = 1 − =1− = .
2 2 2
L.H.S. = R.H.S.
The statement is true for n = 1.
(2) Assume the statement is true for n = k, that is
! "2 ! "k ! "k
1 1 1 1
+ + ··· + =1−
2 2 2 2
We will show that the statement is true for n = k + 1, that is
! "2 ! "k+1 ! "k+1
1 1 1 1
+ + ··· + =1−
2 2 2 2
It is proved that
! "2 ! "k+1 ! "2 ! "k ! "k+1
1 1 1 1 1 1 1
+ + ··· + = + + ··· + +
2 2 2 2 2 2 2
! "k ! "k+1
1 1
=1− +
2 2
1 1
= 1 − k + k+1
2 2
2 1
= 1 − k+1 + k+1
2 2
2−1
= 1 − k+1
2
1
= 1 − k+1
2
! "k+1
1
=1−
2
Therefore, the statement is true for n = k + 1.
(3) Hence, by the principle of mathematical induction, the statement P (n) is true
for all natural numbers n.

4
Chapter 2 Mathematical Induction Grade 12 Mathematics

5. Use the mathematical induction principle to prove that 7n − 1 is a multiple of 3 for

all natural numbers n.

Solution
Let P (n) be the statement that 7n − 1 is a multiple of 3.

(1) For n = 1,
71 − 1 = 6
Since 6 = 3 · 2, which is a multiple of 3.
The statement is true for n = 1.
(2) Assume the statement is true for n = k, that is,

7k − 1 is a multiple of 3.

We will show that the statement is true for n = k + 1, that is,

7k+1 − 1 is a multiple of 3.

It is showed that

7k+1 − 1 = 7 · 7k − 1
= (6 + 1) · 7k − 1
= 6.7k + 7k − 1

Since 7k − 1 is a multiple of 3 and 6 · 7k is also a multiple of 3.

So, 6.7k + 7k − 1 is a multiple of 3.
Therefore, the statement is true for n = k + 1.
(3) Hence, by the principle of mathematical induction, the statement P (n) is true
for all natural numbers n.

5
Chapter 2 Mathematical Induction Grade 12 Mathematics

6. Prove, by using the mathematical induction principle, that n3 + 2n is divisible by

3 for all natural numbers n.

Solution
Let P (n) be the statement that n3 + 2n is divisible by 3.

(1) For n = 1,
13 + 2(1) = 1 + 2 = 3
Since 3 is divisible by 3, the statement is true for n = 1.
(2) Assume the statement is true for n = k, that is,

k 3 + 2k is divisible by 3.
We will show that the statement is true for n = k + 1, that is,

(k + 1)3 + 2(k + 1) is divisible by 3.

It is showed that

(k + 1)3 + 2(k + 1) = (k 3 + 3k 2 + 3k + 1) + (2k + 2)

= k 3 + 3k 2 + 5k + 3
= (k 3 + 2k) + 3k 2 + 3k + 3
= (k 3 + 2k) + 3(k 2 + k + 1)

Since k 3 + 2k is divisible by 3 and 3(k 2 + k + 1) is also divisible by 3.

So, (k 3 + 2k) + 3(k 2 + k + 1) is divisible by 3.
Therefore, the statement is true for n = k + 1.
(3) Hence, by the principle of mathematical induction, the statement P (n) is true
for all natural numbers n.

6
Chapter 2 Mathematical Induction Grade 12 Mathematics

7. Prove that 32n − 1 is divisible by 8 for all natural numbers n ≥ 1 by using principle
of mathematical induction.

Solution
Let P (n) be the statement that 32n − 1 is divisible by 8.

(1) For n = 1,
32(1) − 1 = 32 − 1 = 9 − 1 = 8
Since 8 is divisible by 8, the statement is true for n = 1.
(2) Assume the statement is true for n = k, k ≥ 1 that is,

32k − 1 is divisible by 8.

We will show that the statement is true for n = k + 1, k ≥ 1 that is,

32(k+1) − 1 is divisible by 8.

It is showed that

32(k+1) − 1 = 32k+2 − 1
= 32 · 32k − 1
= 9 · 32k − 1
= (8 + 1) · 32k − 1
= 8 · 32k + 32k − 1

Since 32k − 1 is divisible by 8 and 8 · 32k is divisible by 8.

So, 8 · 32k + 32k − 1 is divisible by 8.
Therefore, the statement is true for n = k + 1,k ≥ 1.
(3) Hence, by the principle of mathematical induction, the statement P (n) is true
for all natural numbers n ≥ 1.

7
Chapter 2 Mathematical Induction Grade 12 Mathematics

8. Use the mathematical induction principle to prove that

3n+1 − 1
1 + 3 + 3 2 + 33 + · · · + 3n =
2
for all natural numbers n.

Solution
Let P (n) denote the statement

3n+1 − 1
1 + 3 + 3 2 + 33 + · · · + 3n = .
2
(1) For n = 1,

L.H.S. = 1 + 3 = 4,
31+1 − 1 9−1
R.H.S. = = = 4.
2 2
L.H.S. = R.H.S.
Therefore, the statement is true for n = 1.
(2) Assume the statement is true for n = k, that is

3k+1 − 1
1 + 3 + 3 2 + 33 + · · · + 3k = .
2
We will show that the statement is true for n = k + 1, that is

3k+2 − 1
1 + 3 + 32 + 33 + · · · + 3k+1 = .
2
It is showed that

1 + 3 + 32 + · · · + 3k+1 = 1 + 3 + 32 + · · · + 3k + 3k+1
3k+1 − 1
= + 3k+1
2
3k+1 − 1 + 2 · 3k+1
=
2
3 · 3k+1 − 1
=
2
3k+2 − 1
= .
2
Therefore, the statement is true for n = k + 1.
(3) Hence, by the principle of mathematical induction, the statement P (n) is true
for all natural numbers n ≥ 1.

8
Chapter 2 Mathematical Induction Grade 12 Mathematics

9. Prove that (n + 1)2 < 2n2 for all natural numbers n ≥ 3 by using the principle of
mathematical induction.

Solution
Let P (n) be the statement that (n + 1)2 < 2n2 , n ≥ 3.

(1) For n = 3,

L.H.S. = (3 + 1)2 = 16,

R.H.S. = 2(32 ) = 18.

Since L.H.S < R.H.S, the statement is true for n = 3.

(2) Assume the statement is true for n = k, k ≥ 3, that is

(k + 1)2 < 2k 2 .

We will show that the statement is true for n = k + 1, k ≥ 3, that is

(k + 2)2 < 2(k + 1)2 .

It is showed that

(k + 2)2 = (k + 1 + 1)2
= (k + 1)2 + 2k + 2 + 1
< 2k 2 + 2k + 3

Since k ≥ 3 =⇒ 2k ≥ 6 =⇒ 2k − 1 ≥ 5 =⇒ 2k − 1 > 0, we have

< 2k 2 + 2k + 3 + 2k − 1
= 2k 2 + 4k + 2
= 2(k 2 + 2k + 1)
= 2(k + 1)2

(k + 2)2 < 2(k + 1)2 .

Therefore, the statement is true for n = k + 1.
(3) Hence, by the principle of mathematical induction, the statement P (n) is true
for all natural numbers n ≥ 3.

9
Chapter 2 Mathematical Induction Grade 12 Mathematics

10. Prove that (2n + 7) < (n + 3)2 for all natural numbers n by using the principle of
mathematical induction.

Solution
Let P (n) be the statement that (2n + 7) < (n + 3)2 .

(1) For n = 1,

L.H.S. = (2(1) + 7) = 9,
R.H.S. = (1 + 3)2 = 16

Since L.H.S < R.H.S, the statement is true for n = 1.

(2) Assume the statement is true for n = k, that is

(2k + 7) < (k + 3)2

We will show that the statement is true for n = k + 1, that is

(2(k + 1) + 7) < (k + 4)2

It is showed that

(2(k + 1) + 7) = 2k + 2 + 7
= 2k + 7 + 2
< (k + 3)2 + 2
= k 2 + 6k + 9 + 2
= k 2 + 6k + 11

Since k ≥ 1 =⇒ 2k ≥ 2 =⇒ 2k + 5 ≥ 7 =⇒ 2k + 5 > 0, we have

< k 2 + 6k + 11 + 2k + 5
= k 2 + 8k + 16
= (k + 4)2

(2k + 7) < (k + 4)2

Therefore, the statement is true for n = k + 1.
(3) Hence, by the principle of mathematical induction, the statement P (n) is true
for all natural numbers n.

10