P a g e |1 Aung Pan Tine (Education Center) Saya.

ANCY

Chapter 2
Mathematical Induction
2.1 Introduction
Mathematical induction is a powerful and elegant technique for proving certain type of
mathematical statements, general propositions which assert that something is true for all
natural numbers or for all natural numbers from some point on.
One of the techniques to prove mathematical statements discussed in this chapter is the
Principle of Mathematical Induction.
The actual term mathematical induction was first used by De Morgan, even though the
method was used by Fermat, Pascal and others before him.
The method is used in many branches of higher mathematics.
Before we state the principle of mathematical induction, let us consider an example.
Consider the sum of the first n odd positive integers. That is,

if 𝑛𝑛 = 1, 1 = 12

if 𝑛𝑛 = 2, 1+3 =4 = 22 ,
if 𝑛𝑛 = 3, 1+3+5 =9 = 32 ,

if 𝑛𝑛 = 4, 1+3+5+7 = 16 = 42 ,

if 𝑛𝑛 = 5, 1+3+5+7+9 = 25 = 52 ,
if 𝑛𝑛 = 6, 1 + 3 + 5 + 7 + 9 + 11 = 36 = 62 .
From the results above, it looks as if the sum of the first 𝒏𝒏 odd natural numbers is always
given by 𝒏𝒏𝟐𝟐 .
To express this statement symbolically, first observe that the 𝒏𝒏𝐭𝐭𝐭𝐭 odd natural number is
𝟐𝟐𝟐𝟐 − 𝟏𝟏. Then the statement can be expressed as:
1 + 3 + 5 + 7 + 9 + … + (2𝑛𝑛 − 1) = 𝑛𝑛2 --- (1)
Although from this pattern we might conjecture that statement (1) is true for any choice of 𝑛𝑛,
can we really be sure that it does not fail for some choice of n?
We have seen that the statement is true for 𝒏𝒏 = 𝟏𝟏, 𝟐𝟐, 𝟑𝟑, 𝟒𝟒, 𝟓𝟓, 𝟔𝟔 by direct calculation.
Is the statement true for any natural number 𝑛𝑛?
Actually, no matter how many cases we check, we can never prove that the statement is
always true because there are infinitely many cases and direct calculation cannot check them all.
The method of proof by mathematical induction will, in fact, prove that any mathematical
statement like (1) is true for all natural numbers 𝑛𝑛.
---------------------------------------------------------------------------------------------------------------------------

GRADE 12 MATHEMATICS
P a g e |2 Aung Pan Tine (Education Center) [Link]

2.2 Principle of Mathematical Induction

For each natural number 𝑛𝑛, let 𝑷𝑷(𝒏𝒏) be a statement depending on 𝒏𝒏. Suppose that the
following two conditions are satisfied.
1. The statement is true for 𝒏𝒏 = 𝟏𝟏.
2. For any natural number 𝑘𝑘, if the statement is true for 𝒏𝒏 = 𝒌𝒌, then the statement is true for
𝒏𝒏 = 𝒌𝒌 + 𝟏𝟏.
Then the statement 𝑷𝑷(𝒏𝒏) is true for all natural number n.
Conclusion: The statement have been proved for 𝑛𝑛 = 1. By the inductive step, since the
statement is true for 𝑛𝑛 = 1, it is also true for 𝑛𝑛 = 2. Again, by the inductive step, since the
statement is true for 𝑛𝑛 = 2, it is also true for 𝑛𝑛 = 3. And since the statement is true for 𝑛𝑛 = 3,
it is also true for 𝑛𝑛 = 4, and so on. Finally, we conclude that the statement is true for all natural
numbers 𝑛𝑛.
Remark: In the inductive step we do not prove that the statement is true for 𝑛𝑛 = 𝑘𝑘. We only show
that if the statement is true for 𝑛𝑛 = 𝑘𝑘, then the statement is also true for 𝑛𝑛 = 𝑘𝑘 + 1. The
assumption that the statement is true for 𝑛𝑛 = 𝑘𝑘, is called the induction hypothesis.
---------------------------------------------------------------------------------------------------------------------------
Example 1.
Use the mathematical induction principle to prove that 1 + 3 + 5 +...+ (2𝑛𝑛 − 1) = 𝑛𝑛2 , for all
natural numbers 𝑛𝑛,
Solution
Let 𝑃𝑃(𝑛𝑛) denote the statement 1 + 3 + 5 + ⋯ + (2𝑛𝑛 − 1) = 𝑛𝑛2
(1) For 𝑛𝑛 = 1, L.H.S = 1,
R.H.S = 12 = 1
L.H.S = R.H.S
The statement is true for 𝑛𝑛 = 1.
(2) Assume that the statement is true for 𝑛𝑛 = 𝑘𝑘, that is
1 + 3 + 5 + ⋯ + (2𝑘𝑘 − 1) = 𝑘𝑘 2 .
We will show that the statement is true for 𝑛𝑛 = 𝑘𝑘 + 1, that is
we have to show that 1 + 3 + 5 + ⋯ + (2𝑘𝑘 − 1) + [(2(𝑘𝑘 + 1) − 1] = (𝑘𝑘 + 1)2
It is proved that
𝟏𝟏 + 𝟑𝟑 + 𝟓𝟓 + ⋯ + (𝟐𝟐𝟐𝟐 − 𝟏𝟏) + [(2(𝑘𝑘 + 1) − 1] = 𝒌𝒌𝟐𝟐 + [(2(𝑘𝑘 + 1) − 1]
= 𝑘𝑘 2 + 2𝑘𝑘 + 2 − 1
= 𝑘𝑘 2 + 2𝑘𝑘 + 1
= (𝑘𝑘 + 1)2
Therefore, the statement is true for 𝑛𝑛 = 𝑘𝑘 + 1.

GRADE 12 MATHEMATICS
P a g e |3 Aung Pan Tine (Education Center) [Link]

(3) Hence, by principle of mathematical induction, the statement 𝑃𝑃(𝑛𝑛) is true for all natural
numbers 𝑛𝑛.
---------------------------------------------------------------------------------------------------------------------------
Example 2.
𝑛𝑛(𝑛𝑛+1)
Use the mathematical induction principle to prove that 1 + 2 + 3 + ⋯ + 𝑛𝑛 = ,for all
2
natural numbers 𝑛𝑛.
Solution:
𝑛𝑛(𝑛𝑛+1)
Let 𝑃𝑃(𝑛𝑛) denote the statement 1 + 2 + 3 + ⋯ + 𝑛𝑛 = ,
2
(1) For 𝑛𝑛 = 1, L.H.S = 1,
1(1+1)
R.H.S = =1
2
L.H.S = R.H.S
The statement is true for 𝑛𝑛 = 1.
(2) Assume that the statement is true for 𝑛𝑛 = 𝑘𝑘, that is
𝑘𝑘(𝑘𝑘+1)
1 + 2 + 3 + ⋯ + 𝑘𝑘 = ,
2
We will show that the statement is true for 𝑛𝑛 = 𝑘𝑘 + 1, that is
(𝑘𝑘+1)(𝑘𝑘+2)
we have to show that 1 + 2 + 3 + ⋯ + 𝑘𝑘 + (𝑘𝑘 + 1) = ,
2
𝒌𝒌(𝒌𝒌+𝟏𝟏)
It is proved that 𝟏𝟏 + 𝟐𝟐 + 𝟑𝟑 + ⋯ + 𝒌𝒌 + (𝑘𝑘 + 1) = + (𝑘𝑘 + 1)
𝟐𝟐
𝑘𝑘 2 +𝑘𝑘+2𝑘𝑘+2
=
2
𝑘𝑘 2 +3𝑘𝑘+2
=
2
(𝑘𝑘+1)(𝑘𝑘+2)
=
2
Therefore, the statement is true for 𝑛𝑛 = 𝑘𝑘 + 1.
(3) Hence, by principle of mathematical induction, the statement 𝑃𝑃(𝑛𝑛) is true for all natural
numbers 𝑛𝑛.
---------------------------------------------------------------------------------------------------------------------------
In some cases, a statement involving, a variable n holds when the natural numbers 𝑛𝑛 ≥ 𝑚𝑚,
𝑚𝑚 ∈ 𝑁𝑁 and the statement does not hold when 𝑛𝑛 < 𝑚𝑚.
In this case, we will prove that the statement is true for 𝑛𝑛 = 𝑚𝑚 in the initial step.
---------------------------------------------------------------------------------------------------------------------------

GRADE 12 MATHEMATICS
P a g e |4 Aung Pan Tine (Education Center) [Link]

Example 3.
Use the mathematical induction principle to prove that 3𝑛𝑛 − 1 is a multiple of 2 for all natural
numbers 𝑛𝑛.
Solution
Let 𝑃𝑃(𝑛𝑛) denotes the statement 3𝑛𝑛 − 1 is a multiple of 2.
(1) For 𝑛𝑛 = 1, 31 − 1 = 2 which is a multiple of 2.
The statement is true for 𝑛𝑛 = 1.
(2) Assume that the statement is true for 𝑛𝑛 = 𝑘𝑘, that is
3𝑘𝑘 − 1 is a multiple of 2.
We will show that the statement is true for 𝑛𝑛 = 𝑘𝑘 + 1, that is
we have to show that 3𝑘𝑘+1 − 1 is a multiple of 2.
we prove that 3𝑘𝑘+1 − 1 = 3 . 3𝑘𝑘 − 1 = 2 . 3𝑘𝑘 + 3𝑘𝑘 −1.
Since 2 . 3𝑘𝑘 is a multiple of 2 and 3𝑘𝑘 −1 is a multiple of 2, we can say that 2 . 3𝑘𝑘 + 3𝑘𝑘 −1 is
also a multiple of 2.
So, 3𝑘𝑘+1 − 1 is also a multiple of 2.
Therefore, the statement is true for 𝑛𝑛 = 𝑘𝑘 + 1.
(3) Hence, by principle of mathematical induction, the statement 𝑃𝑃(𝑛𝑛) is true for all natural
numbers 𝑛𝑛.
---------------------------------------------------------------------------------------------------------------------------
Example 4.
Prove that (𝑎𝑎𝑎𝑎)𝑛𝑛 = 𝑎𝑎𝑛𝑛 𝑏𝑏 𝑛𝑛 for every natural number 𝑛𝑛.
Solution
Let 𝑃𝑃(𝑛𝑛) denote the statement (𝑎𝑎𝑎𝑎)𝑛𝑛 = 𝑎𝑎𝑛𝑛 𝑏𝑏 𝑛𝑛 .
(1) For 𝑛𝑛 = 1, L.H.S = (𝑎𝑎𝑎𝑎)1 = 𝑎𝑎𝑎𝑎
R.H.S = 𝑎𝑎1 𝑏𝑏1 = 𝑎𝑎𝑎𝑎
L.H.S = R.H.S
The statement is true for 𝑛𝑛 = 1.
(2) Assume that the statement is true for 𝑛𝑛 = 𝑘𝑘, that is
(𝑎𝑎𝑎𝑎)𝑘𝑘 = 𝑎𝑎𝑘𝑘 𝑏𝑏𝑘𝑘
We will show that the statement is true for 𝑛𝑛 = 𝑘𝑘 + 1, that is
we have to show that (𝑎𝑎𝑎𝑎)𝑘𝑘+1 = 𝑎𝑎𝑘𝑘+1 𝑏𝑏𝑘𝑘+1
It is prove that (𝑎𝑎𝑎𝑎)𝑘𝑘+1 = (𝒂𝒂𝒂𝒂)𝒌𝒌 (𝑎𝑎𝑎𝑎) = �𝒂𝒂𝒌𝒌 𝒃𝒃𝒌𝒌 � (𝑎𝑎𝑎𝑎) = 𝑎𝑎𝑘𝑘+1 𝑏𝑏𝑘𝑘+1.
Therefore, the statement is true for 𝑛𝑛 = 𝑘𝑘 + 1.
(3) Hence, by principle of mathematical induction, the statement 𝑃𝑃(𝑛𝑛) is true for all natural
numbers 𝑛𝑛.
---------------------------------------------------------------------------------------------------------------------------

GRADE 12 MATHEMATICS
P a g e |5 Aung Pan Tine (Education Center) [Link]

Example 5.
(2𝑛𝑛−1)3𝑛𝑛+1 +3
Prove that 1.3 + 2. 32 + 3. 33 + ⋯ + 𝑛𝑛. 3𝑛𝑛 = for all natural number n by the use of
4

the mathematical induction principle.

Solution
(2𝑛𝑛−1)3𝑛𝑛+1 +3
Let 𝑃𝑃(𝑛𝑛) denote the statement 1.3 + 2. 32 + 3. 33 + ⋯ + 𝑛𝑛. 3𝑛𝑛 = .
4
(1) For n = 1, L.H.S =1.3 = 3,
(2−1)32 +3 12
R.H.S = = = 3.
4 4
L.H.S = R.H.S
The statement is true for 𝑛𝑛 = 1.
(2) Assume that the statement is true for 𝑛𝑛 = 𝑘𝑘, that is
(2𝑘𝑘−1)3𝑘𝑘+1 +3
1.3 + 2. 32 + 3. 33 + ⋯ + 𝑘𝑘. 3𝑘𝑘 = .
4
We will show that the statement is true for 𝑛𝑛 = 𝑘𝑘 + 1, that is
we have to show that
(2(𝑘𝑘+1)−1)3𝑘𝑘+2 +3
1.3 + 2. 32 + 3. 33 + ⋯ + 𝑘𝑘. 3𝑘𝑘 + (𝑘𝑘 + 1). 3𝑘𝑘+1 =
4
It is prove that
(𝟐𝟐𝟐𝟐−𝟏𝟏)𝟑𝟑𝒌𝒌+𝟏𝟏 +𝟑𝟑
𝟏𝟏. 𝟑𝟑 + 𝟐𝟐. 𝟑𝟑𝟐𝟐 + 𝟑𝟑. 𝟑𝟑𝟑𝟑 + ⋯ + 𝒌𝒌. 𝟑𝟑𝒌𝒌 + (𝑘𝑘 + 1). 3𝑘𝑘+1 = + (𝑘𝑘 + 1). 3𝑘𝑘+1
𝟒𝟒
(2𝑘𝑘−1)3𝑘𝑘+1 +3+4(𝑘𝑘+1).3𝑘𝑘+1
=
4
(6𝑘𝑘+3)3𝑘𝑘+1 +3
=
4
3(2𝑘𝑘+1)3𝑘𝑘+1 +3
=
4
(2𝑘𝑘+1)3𝑘𝑘+2 +3 (2(𝑘𝑘+1)−1)3𝑘𝑘+2 +3
= =
4 4
Therefore, the statement is true for 𝑛𝑛 = 𝑘𝑘 + 1.
(3) Hence, by principle of mathematical induction, the statement 𝑃𝑃(𝑛𝑛) is true for all natural
numbers 𝑛𝑛.
---------------------------------------------------------------------------------------------------------------------------
Example 6.
Use the mathematical induction principle to prove that 𝑎𝑎 − 𝑏𝑏 is a factor of 𝑎𝑎𝑛𝑛 − 𝑏𝑏 𝑛𝑛 for all natural
numbers 𝑛𝑛.
Solution

GRADE 12 MATHEMATICS
P a g e |6 Aung Pan Tine (Education Center) [Link]

Let 𝑃𝑃(𝑛𝑛) denote the statement 𝑎𝑎 − 𝑏𝑏 is a factor of 𝑎𝑎𝑛𝑛 − 𝑏𝑏 𝑛𝑛 .

(1) For 𝑛𝑛 = 1, 𝑎𝑎1 − 𝑏𝑏1 = 𝑎𝑎 − 𝑏𝑏.
So, 𝑎𝑎 − 𝑏𝑏 is a factor of 𝑎𝑎1 − 𝑏𝑏1 .
The statement is true for 𝑛𝑛 = 1.
(2) Assume that the statement is true for 𝑛𝑛 = 𝑘𝑘, that is 𝑎𝑎 − 𝑏𝑏 is a factor of 𝑎𝑎𝑘𝑘 − 𝑏𝑏 𝑘𝑘 .
We will show that the statement is true for 𝑛𝑛 = 𝑘𝑘 + 1, that is we have to show that 𝑎𝑎 − 𝑏𝑏 is a
factor of 𝑎𝑎𝑘𝑘+1 − 𝑏𝑏 𝑘𝑘+1
It is prove that
𝑎𝑎𝑘𝑘+1 − 𝑏𝑏 𝑘𝑘+1 = 𝑎𝑎𝑘𝑘+1 − 𝑎𝑎𝑘𝑘 𝑏𝑏 + 𝑎𝑎𝑘𝑘 𝑏𝑏 − 𝑏𝑏 𝑘𝑘+1
= 𝑎𝑎𝑘𝑘 (𝑎𝑎 − 𝑏𝑏) + 𝑏𝑏(𝑎𝑎𝑘𝑘 − 𝑏𝑏 𝑘𝑘 ).
Since 𝑎𝑎 − 𝑏𝑏 is a factor of 𝑎𝑎𝑘𝑘 (𝑎𝑎 − 𝑏𝑏) and 𝑎𝑎 − 𝑏𝑏 is a factor of 𝑎𝑎𝑘𝑘 − 𝑏𝑏 𝑘𝑘 , 𝑎𝑎 − 𝑏𝑏 is also a factor of
𝑎𝑎𝑘𝑘 (𝑎𝑎 − 𝑏𝑏) + 𝑏𝑏(𝑎𝑎𝑘𝑘 − 𝑏𝑏 𝑘𝑘 ).
So, 𝑎𝑎 − 𝑏𝑏 is a factor of 𝑎𝑎𝑘𝑘+1 − 𝑏𝑏 𝑘𝑘+1 .
Therefore, the statement is true for 𝑛𝑛 = 𝑘𝑘 + 1.
(3) Hence, by principle of mathematical induction, the statement 𝑃𝑃(𝑛𝑛) is true for all natural
numbers 𝑛𝑛.
---------------------------------------------------------------------------------------------------------------------------
Example 7.
Use the mathematical induction principle to prove that 4𝑛𝑛 < 2𝑛𝑛 for all natural numbers 𝑛𝑛 ≥ 5.
Solution
Let 𝑃𝑃(𝑛𝑛) denote the statement 4𝑛𝑛 < 2𝑛𝑛 .
(1) For 𝑛𝑛 = 5, L.H.S = 4(5) = 20
R.H.S = 25 = 32
L.H.S < R.H.S.
The statement is true for 𝑛𝑛 = 5.
(2) Assume that the statement is true for 𝑛𝑛 = 𝑘𝑘 ≥ 5, that is
4𝑘𝑘 < 2𝑘𝑘
We will show that the statement is true for 𝑛𝑛 = 𝑘𝑘 + 1, that is we have to show that
4(𝑘𝑘 + 1) < 2𝑘𝑘+1 .
It is prove that 4(𝑘𝑘 + 1) = 4𝑘𝑘 + 4
< 2𝑘𝑘 + 4
< 2𝑘𝑘 + 4𝑘𝑘 (since 4 < 4𝑘𝑘)
< 2𝑘𝑘 + 2𝑘𝑘
< 2 . 2𝑘𝑘 = 2𝑘𝑘+1
Hence 4(𝑘𝑘 + 1) < 2𝑘𝑘+1 .

GRADE 12 MATHEMATICS
P a g e |7 Aung Pan Tine (Education Center) [Link]

Therefore, the statement is true for 𝑛𝑛 = 𝑘𝑘 + 1.

(3) Hence, by principle of mathematical induction, the statement 𝑃𝑃(𝑛𝑛) is true for all natural
numbers 𝑛𝑛 ≥ 5.
---------------------------------------------------------------------------------------------------------------------------
Exercise 2.1
1. Prove the following by using the principle of mathematical induction for all natural number
𝑛𝑛:
3𝑛𝑛 −1
(a) 1 + 3 + 32 + … + 3𝑛𝑛−1 =
2

Solution:
3𝑛𝑛 −1
Let 𝑃𝑃(𝑛𝑛) denote the statement 1 + 3 + 32 + … + 3𝑛𝑛−1 =
2
(1) For 𝑛𝑛 = 1, L.H.S = 1
31 −1
R.H.S = =1
2
L.H.S = R.H.S.
The statement is true for 𝑛𝑛 = 1.
(2) Assume that the statement is true for 𝑛𝑛 = 𝑘𝑘, that is
3𝑘𝑘 −1
1 + 3 + 32 + … + 3𝑘𝑘−1 =
2
We will show that the statement is true for 𝑛𝑛 = 𝑘𝑘 + 1, that is we have to show that
3𝑘𝑘+1 −1
1 + 3 + 32 + … + 3𝑘𝑘−1 + 3𝑘𝑘 = .
2
L.H.S = 1 + 3 + 32 + … + 𝟑𝟑𝒌𝒌−𝟏𝟏 + 3𝑘𝑘
𝟑𝟑𝒌𝒌 −𝟏𝟏
= + 3𝑘𝑘
𝟐𝟐
3𝑘𝑘 −1+2.3𝑘𝑘
=
2
3𝑘𝑘 +2.3𝑘𝑘 −1
=
2
3𝑘𝑘 (1+2)−1
=
2
3𝑘𝑘 .3−1 3𝑘𝑘+1 −1
= = = R.H.S.
2 2
Therefore, the statement is true for 𝑛𝑛 = 𝑘𝑘 + 1.
(3) Hence, by principle of mathematical induction, the statement 𝑃𝑃(𝑛𝑛) is true for all natural
numbers 𝑛𝑛.
---------------------------------------------------------------------------------------------------------------------------

GRADE 12 MATHEMATICS
P a g e |8 Aung Pan Tine (Education Center) [Link]

𝑛𝑛(𝑛𝑛+1) 2
(b) 13 + 23 + 33 + … + 𝑛𝑛3 = � � .
2
Solution:
𝑛𝑛(𝑛𝑛+1) 2
Let 𝑃𝑃(𝑛𝑛) denote the statement 13 + 23 + 33 + … + 𝑛𝑛3 = � �
2
(1) For 𝑛𝑛 = 1, L.H.S = 1
1(1+1) 2
R.H.S = � � = 1.
2
L.H.S = R.H.S
The statement is true for 𝑛𝑛 = 1.
(2) Assume that the statement is true for 𝑛𝑛 = 𝑘𝑘, that is
𝑘𝑘(𝑘𝑘+1) 2
13 + 23 + 33 + … + 𝑘𝑘3 = � �
2
We will show that the statement is true for 𝑛𝑛 = 𝑘𝑘 + 1, that is we have to show that
(𝑘𝑘+1)(𝑘𝑘+2) 2
13 + 23 + 33 + … + 𝑘𝑘3 + (𝑘𝑘 + 1)3 = � �
2
L.H.S = 13 + 23 + 33 + … + 𝒌𝒌𝟑𝟑 + (𝑘𝑘 + 1)3
𝒌𝒌(𝒌𝒌+𝟏𝟏) 𝟐𝟐
= � 𝟐𝟐
� + (𝑘𝑘 + 1)3

𝑘𝑘 2
= (𝑘𝑘 + 1)2 � 4 + 𝑘𝑘 + 1�
𝑘𝑘 2 +4𝑘𝑘+4
=(𝑘𝑘 + 1)2 � �
4

𝑘𝑘+2 2
=(𝑘𝑘 + 1)2 � 2
�

(𝑘𝑘+1)(𝑘𝑘+2) 2
=� � = R.H.S.
2
Therefore, the statement is true for 𝑛𝑛 = 𝑘𝑘 + 1.
(3) Hence, by principle of mathematical induction, the statement 𝑃𝑃(𝑛𝑛) is true for all natural
numbers 𝑛𝑛.
---------------------------------------------------------------------------------------------------------------------------
(c) 23 + 43 + 63 + … + (2𝑛𝑛)3 = 2𝑛𝑛2 (𝑛𝑛 + 1)2
Solution:
Let 𝑃𝑃(𝑛𝑛) denote the statement 23 + 43 + 63 + … + (2𝑛𝑛)3 = 2𝑛𝑛2 (𝑛𝑛 + 1)2
(1) For 𝑛𝑛 = 1, L.H.S = 23 = 8,
R.H.S = 2(1)2 (1 + 1)2 = 8.
L.H.S = R.H.S

GRADE 12 MATHEMATICS
P a g e |9 Aung Pan Tine (Education Center) [Link]

The statement is true for 𝑛𝑛 = 1.

(2) Assume that the statement is true for 𝑛𝑛 = 𝑘𝑘, that is
23 + 43 + 63 + … + (2𝑘𝑘)3 = 2𝑘𝑘 2 (𝑘𝑘 + 1)2
We will show that the statement is true for 𝑛𝑛 = 𝑘𝑘 + 1, that is we have to show that
23 + 43 + 63 + … + (2𝑘𝑘)3 + (2(𝑘𝑘 + 1))3 = 2(𝑘𝑘 + 1)2 (𝑘𝑘 + 2)2
L.H.S = 𝟐𝟐𝟑𝟑 + 𝟒𝟒𝟒𝟒 + 𝟔𝟔𝟔𝟔 + … + (𝟐𝟐𝟐𝟐)𝟑𝟑 + (2(𝑘𝑘 + 1))3
= 𝟐𝟐𝒌𝒌𝟐𝟐 (𝒌𝒌 + 𝟏𝟏)𝟐𝟐 + (2(𝑘𝑘 + 1))3
= 2(𝑘𝑘 + 1)2 (𝑘𝑘 2 + 4(𝑘𝑘 + 1))
= 2(𝑘𝑘 + 1)2 (𝑘𝑘 2 + 4𝑘𝑘 + 4)
= 2(𝑘𝑘 + 1)2 (𝑘𝑘 + 2)2 = R.H.S
Therefore, the statement is true for 𝑛𝑛 = 𝑘𝑘 + 1.
(3) Hence, by principle of mathematical induction, the statement 𝑃𝑃(𝑛𝑛) is true for all natural
numbers 𝑛𝑛.
---------------------------------------------------------------------------------------------------------------------------
1
(d) (1 . 2) + (2 . 3) + (3 . 4) + … + 𝑛𝑛 (𝑛𝑛 + 1) = 𝑛𝑛 (𝑛𝑛 + 1) (𝑛𝑛 + 2)
3

Solution:
Let 𝑃𝑃(𝑛𝑛) denote the statement
1
(1 . 2) + (2 . 3) + (3 . 4) + … + 𝑛𝑛 (𝑛𝑛 + 1) = 𝑛𝑛 (𝑛𝑛 + 1) (𝑛𝑛 + 2)
3
(1) For 𝑛𝑛 = 1, L.H.S = (1 . 2) = 2,
1
R.H.S = (1) (2) (3) = 2.
3
L.H.S = R.H.S
The statement is true for 𝑛𝑛 = 1.
(2) Assume that the statement is true for 𝑛𝑛 = 𝑘𝑘, that is
1
(1 . 2) + (2 . 3) + (3 . 4) + … + 𝑘𝑘 (𝑘𝑘 + 1) = 𝑘𝑘 (𝑘𝑘 + 1) (𝑘𝑘 + 2)
3
We will show that the statement is true for 𝑛𝑛 = 𝑘𝑘 + 1, that is we have to show that
1
(1 . 2)+(2 . 3)+(3 . 4) + … + 𝑘𝑘(𝑘𝑘 + 1) + (𝑘𝑘 + 1) (𝑘𝑘 + 2) = (𝑘𝑘 + 1) (𝑘𝑘 + 2) (𝑘𝑘 + 3)
3
L.H.S = (1 . 2) + (2 . 3) + (3 . 4) + … + 𝒌𝒌 (𝒌𝒌 + 𝟏𝟏) + (𝑘𝑘 + 1) (𝑘𝑘 + 2)
𝟏𝟏
= 𝒌𝒌 (𝒌𝒌 + 𝟏𝟏) (𝒌𝒌 + 𝟐𝟐) + (𝑘𝑘 + 1) (𝑘𝑘 + 2)
𝟑𝟑
1
= (𝑘𝑘 + 1) (𝑘𝑘 + 2) (𝑘𝑘 + 3) = R.H.S
3

Therefore, the statement is true for 𝑛𝑛 = 𝑘𝑘 + 1.

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

GRADE 12 MATHEMATICS
P a g e | 10 Aung Pan Tine (Education Center) [Link]

---------------------------------------------------------------------------------------------------------------------------
1 1 1 1 1
(e) + + +…+ =1−
2 4 8 2𝑛𝑛 2𝑛𝑛
Solution:
1 1 1 1 1
Let 𝑃𝑃(𝑛𝑛) denote the statement + + + … + =1−
2 4 8 2𝑛𝑛 2𝑛𝑛
1
(1) For 𝑛𝑛 = 1, L.H.S = ,
2
1 1
R.H.S = 1 − =
2 2
L.H.S = R.H.S
The statement is true for 𝑛𝑛 = 1.
(2) Assume that the statement is true for 𝑛𝑛 = 𝑘𝑘, that is
1 1 1 1 1
+ + +…+ =1−
2 4 8 2𝑘𝑘 2𝑘𝑘
We will show that the statement is true for 𝑛𝑛 = 𝑘𝑘 + 1, that is we have to show that
1 1 1 1 1 1
+ + +…+ 𝑘𝑘
+ 𝑘𝑘+1
=1−
2 4 8 2 2 2𝑘𝑘+1
𝟏𝟏 𝟏𝟏 𝟏𝟏 𝟏𝟏 1
L.H.S = + + +…+ 𝒌𝒌
+
𝟐𝟐 𝟒𝟒 𝟖𝟖 𝟐𝟐 2𝑘𝑘+1
𝟏𝟏 1
=1− +
𝟐𝟐𝒌𝒌 2𝑘𝑘+1
2 1
=1− +
2𝑘𝑘+1 2𝑘𝑘+1
1
=1− = R.H.S
2𝑘𝑘+1
Therefore, the statement is true for 𝑛𝑛 = 𝑘𝑘 + 1.
(3) Hence, by principle of mathematical induction, the statement 𝑃𝑃(𝑛𝑛) is true for all natural
numbers 𝑛𝑛.
---------------------------------------------------------------------------------------------------------------------------
(f) 1 + 2 + 22 + … + 2𝑛𝑛−1 = 2𝑛𝑛 − 1
Solution:
Let 𝑃𝑃(𝑛𝑛) denote the statement 1 + 2 + 22 + … + 2𝑛𝑛−1 = 2𝑛𝑛 − 1
(1) For 𝑛𝑛 = 1, L.H.S = 1,
R.H.S = 21 − 1 = 2 − 1 = 1
L.H.S = R.H.S
The statement is true for 𝑛𝑛 = 1.
(2) Assume that the statement is true for 𝑛𝑛 = 𝑘𝑘, that is
1 + 2 + 22 + … + 2𝑘𝑘−1 = 2𝑘𝑘 − 1

GRADE 12 MATHEMATICS
P a g e | 11 Aung Pan Tine (Education Center) [Link]

We will show that the statement is true for 𝑛𝑛 = 𝑘𝑘 + 1, that is we have to show that
1 + 2 + 22 + … + 2𝑘𝑘−1 + 2𝑘𝑘 = 2𝑘𝑘+1 − 1
L.H.S = 𝟏𝟏 + 𝟐𝟐 + 𝟐𝟐𝟐𝟐 + … + 𝟐𝟐𝒌𝒌−𝟏𝟏 + 2𝑘𝑘
= 𝟐𝟐𝒌𝒌 − 𝟏𝟏 + 2𝑘𝑘
= 2.2𝑘𝑘 − 1
= 2𝑘𝑘+1 − 1 = R.H.S
Therefore, the statement is true for 𝑛𝑛 = 𝑘𝑘 + 1.
(3) Hence, by principle of mathematical induction, the statement 𝑃𝑃(𝑛𝑛) is true for all natural
numbers 𝑛𝑛.
---------------------------------------------------------------------------------------------------------------------------
1 1 1 1 𝑛𝑛
(g) + + +…+ =
1. 2 2. 3 3. 4 𝑛𝑛 (𝑛𝑛+1) (𝑛𝑛+1)

Solution:
1 1 1 1 𝑛𝑛
Let 𝑃𝑃(𝑛𝑛) denote the statement + + +…+ =
1. 2 2. 3 3. 4 𝑛𝑛 (𝑛𝑛+1) (𝑛𝑛+1)
1 1
(1) For 𝑛𝑛 = 1, L.H.S = = ,
1. 2 2
1 1
R.H.S = =
(1+1) 2

L.H.S = R.H.S
The statement is true for 𝑛𝑛 = 1.
(2) Assume that the statement is true for 𝑛𝑛 = 𝑘𝑘, that is
1 1 1 1 𝑘𝑘
+ + +…+ =
1. 2 2. 3 3. 4 𝑘𝑘 (𝑘𝑘+1) (𝑘𝑘+1)

We will show that the statement is true for 𝑛𝑛 = 𝑘𝑘 + 1, that is we have to show that
1 1 1 1 1 𝑘𝑘+1
+ + +…+ + =
1. 2 2. 3 3. 4 𝑘𝑘 (𝑘𝑘+1) (𝑘𝑘+1) (𝑘𝑘+2) (𝑘𝑘+1)
𝟏𝟏 𝟏𝟏 𝟏𝟏 𝟏𝟏 1
L.H.S = + + +…+ +
𝟏𝟏 . 𝟐𝟐 𝟐𝟐 . 𝟑𝟑 𝟑𝟑 . 𝟒𝟒 𝒌𝒌 (𝒌𝒌+𝟏𝟏) (𝑘𝑘+1) (𝑘𝑘+2)
𝒌𝒌 1
= +
𝒌𝒌+𝟏𝟏 (𝑘𝑘+1) (𝑘𝑘+2)

𝑘𝑘 2 +2𝑘𝑘+1
=
(𝑘𝑘+1) (𝑘𝑘+2)

(𝑘𝑘+1)2
=
(𝑘𝑘+1) (𝑘𝑘+2)
𝑘𝑘+1
= = R.H.S
𝑘𝑘+2
Therefore, the statement is true for 𝑛𝑛 = 𝑘𝑘 + 1.

GRADE 12 MATHEMATICS
P a g e | 12 Aung Pan Tine (Education Center) [Link]

(3) Hence, by principle of mathematical induction, the statement 𝑃𝑃(𝑛𝑛) is true for all natural
numbers 𝑛𝑛.
---------------------------------------------------------------------------------------------------------------------------
2. Prove that 3 is a factor of 4𝑛𝑛 − 1 for all natural numbers 𝑛𝑛 by using the mathematical
induction.
Solution:
Let 𝑃𝑃(𝑛𝑛) denote the statement 3 is a factor of 4𝑛𝑛 − 1 .
(1) For 𝑛𝑛 = 1, 41 − 1 = 4 − 1 = 3
So, 3 is a factor of 41 − 1 .
The statement is true for 𝑛𝑛 = 1.
(2) Assume that the statement is true for 𝑛𝑛 = 𝑘𝑘, that is
3 is a factor of 4𝑘𝑘 − 1 .
Let 4𝑘𝑘 − 1 = 3𝑚𝑚, 𝑚𝑚 ∈ 𝑁𝑁
We will show that the statement is true for 𝑛𝑛 = 𝑘𝑘 + 1, that is we have to show that
3 is a factor of 4𝑘𝑘+1 − 1 .
4𝑘𝑘+1 − 1 = 4 . 4𝑘𝑘 − 1
= 3 . 4𝑘𝑘 + 𝟒𝟒𝒌𝒌 − 1
= 3 . 4𝑘𝑘 + 𝟑𝟑𝟑𝟑
= 3 (4𝑘𝑘 + 𝑚𝑚)
So, 3 is a factor of 4𝑘𝑘+1 − 1 .
Therefore, the statement is true for 𝑛𝑛 = 𝑘𝑘 + 1.
(3) Hence, by principle of mathematical induction, the statement 𝑃𝑃(𝑛𝑛) is true for all natural
numbers 𝑛𝑛.
---------------------------------------------------------------------------------------------------------------------------
3. Prove that 𝑛𝑛3 − 𝑛𝑛 + 3 is divisible by 3 for all natural numbers 𝑛𝑛 by using the mathematical
induction.
Solution:
Let 𝑃𝑃(𝑛𝑛) denote the statement 𝑛𝑛3 − 𝑛𝑛 + 3 is divisible by 3 .
(1) For 𝑛𝑛 = 1, 13 − 1 + 3 = 3 is divisible by 3.
The statement is true for 𝑛𝑛 = 1.
(2) Assume that the statement is true for 𝑛𝑛 = 𝑘𝑘, that is
𝑘𝑘 3 − 𝑘𝑘 + 3 is divisible by 3.
Let 𝑘𝑘 3 − 𝑘𝑘 + 3 = 3𝑚𝑚, 𝑚𝑚 ∈ 𝑁𝑁
We will show that the statement is true for 𝑛𝑛 = 𝑘𝑘 + 1, that is we have to show that
(𝑘𝑘 + 1)3 − (𝑘𝑘 + 1) + 3 is divisible by 3.
(𝑘𝑘 + 1)3 − (𝑘𝑘 + 1) + 3 = 𝑘𝑘 3 + 3𝑘𝑘 2 + 3𝑘𝑘 + 1 − 𝑘𝑘 − 1 + 3

GRADE 12 MATHEMATICS
P a g e | 13 Aung Pan Tine (Education Center) [Link]

= 𝒌𝒌𝟑𝟑 − 𝒌𝒌 + 3 + 3 (𝑘𝑘 2 + 𝑘𝑘)

= 𝟑𝟑𝟑𝟑 + 3 (𝑘𝑘 2 + 𝑘𝑘)
= 3 (𝑚𝑚 + 𝑘𝑘 2 + 𝑘𝑘) which is divisible by 3.
Therefore, the statement is true for 𝑛𝑛 = 𝑘𝑘 + 1.
(3) Hence, by principle of mathematical induction, the statement 𝑃𝑃(𝑛𝑛) is true for all natural
numbers 𝑛𝑛.
---------------------------------------------------------------------------------------------------------------------------
4. Prove that 32𝑛𝑛 − 1 is divisible by 8 for all natural numbers 𝑛𝑛 by using the mathematical
induction.
Solution:
Let 𝑃𝑃(𝑛𝑛) denote the statement 32𝑛𝑛 − 1 is divisible by 8 .
(1) For 𝑛𝑛 = 1, 32(1) − 1 = 9 − 1 = 8 is divisible by 8.
The statement is true for 𝑛𝑛 = 1.
(2) Assume that the statement is true for 𝑛𝑛 = 𝑘𝑘, that is
32𝑘𝑘 − 1 is divisible by 8 .
Let 32𝑘𝑘 − 1 = 8𝑚𝑚, 𝑚𝑚 ∈ 𝑁𝑁
We will show that the statement is true for 𝑛𝑛 = 𝑘𝑘 + 1, that is we have to show that
32(𝑘𝑘+1) − 1 is divisible by 8 .
32(𝑘𝑘+1) − 1 = 32𝑘𝑘+2 − 1
= 32 . 32𝑘𝑘 − 1
= 9 . 32𝑘𝑘 − 1
= 8 . 32𝑘𝑘 + 𝟑𝟑𝟐𝟐𝟐𝟐 − 𝟏𝟏
= 8 . 32𝑘𝑘 + 𝟖𝟖𝟖𝟖
= 8 (32𝑘𝑘 + 𝑚𝑚) which is divisible by 8.
Therefore, the statement is true for 𝑛𝑛 = 𝑘𝑘 + 1.
(3) Hence, by principle of mathematical induction, the statement 𝑃𝑃(𝑛𝑛) is true for all natural
numbers 𝑛𝑛.
---------------------------------------------------------------------------------------------------------------------------
5. Prove that (𝑛𝑛 + 1)2 < 2𝑛𝑛2 for all natural numbers 𝑛𝑛 ≥ 3 by using the mathematical
induction.
Solution:
Let 𝑃𝑃(𝑛𝑛) denote the statement (𝑛𝑛 + 1)2 < 2𝑛𝑛2 .
(1) For 𝑛𝑛 = 3, L.H.S = (3 + 1)2 = 16
R.H.S = 2(3)2 = 18
L.H.S < R.H.S.

GRADE 12 MATHEMATICS
P a g e | 14 Aung Pan Tine (Education Center) [Link]

The statement is true for 𝑛𝑛 = 1.

(2) Assume that the statement is true for 𝑛𝑛 = 𝑘𝑘, that is
(𝑘𝑘 + 1)2 < 2𝑘𝑘 2
We will show that the statement is true for 𝑛𝑛 = 𝑘𝑘 + 1, that is we have to show that
(𝑘𝑘 + 2)2 < 2(𝑘𝑘 + 1)2
(𝑘𝑘 + 2)2 = 𝑘𝑘 2 + 4𝑘𝑘 + 4
= 𝑘𝑘 2 + 2𝑘𝑘 + 1 + 2𝑘𝑘 + 3
= (𝒌𝒌 + 𝟏𝟏)𝟐𝟐 + 2𝑘𝑘 + 3
< 𝟐𝟐𝟐𝟐𝟐𝟐 +2𝑘𝑘 + 3
< 2𝑘𝑘 2 +4𝑘𝑘 + 2 = 2(𝑘𝑘 + 1)2 (∵ 1 < 2𝑘𝑘)
Therefore, the statement is true for 𝑛𝑛 = 𝑘𝑘 + 1.
(3) Hence, by principle of mathematical induction, the statement 𝑃𝑃(𝑛𝑛) is true for all natural
numbers 𝑛𝑛 ≥ 3.
---------------------------------------------------------------------------------------------------------------------------
6. Prove that (2𝑛𝑛 + 7) < (𝑛𝑛 + 3)2 for all natural numbers 𝑛𝑛 by using the mathematical
induction.
Solution:
Let 𝑃𝑃(𝑛𝑛) denote the statement (2𝑛𝑛 + 7) < (𝑛𝑛 + 3)2 .
(1) For 𝑛𝑛 = 1, L.H.S =(2(1) + 7) = 9
R.H.S = (1 + 3)2 = 16
L.H.S < R.H.S.
The statement is true for 𝑛𝑛 = 1.
(2) Assume that the statement is true for 𝑛𝑛 = 𝑘𝑘, that is
(2𝑘𝑘 + 7) < (𝑘𝑘 + 3)2
We will show that the statement is true for 𝑛𝑛 = 𝑘𝑘 + 1, that is we have to show that
(2(𝑘𝑘 + 1) + 7) < (𝑘𝑘 + 4)2
(2(𝑘𝑘 + 1) + 7) = 𝟐𝟐𝟐𝟐 + 𝟕𝟕 + 2
< (𝒌𝒌 + 𝟑𝟑)𝟐𝟐 + 2 = (𝑘𝑘 + 4 − 1)2 + 2 = (𝑘𝑘 + 4)2 − 2(𝑘𝑘 + 4) + 3 < (𝑘𝑘 + 4)2
Therefore, the statement is true for 𝑛𝑛 = 𝑘𝑘 + 1.
(3) Hence, by principle of mathematical induction, the statement 𝑃𝑃(𝑛𝑛) is true for all natural
numbers 𝑛𝑛.
---------------------------------------------------------------------------------------------------------------------------
7. Prove that 𝑥𝑥 2𝑛𝑛 − 𝑦𝑦 2𝑛𝑛 is divisible by 𝑥𝑥 + 𝑦𝑦 for all natural numbers 𝑛𝑛 by using the
mathematical induction.
Solution:
Let 𝑃𝑃(𝑛𝑛) denote the statement 𝑥𝑥 2𝑛𝑛 − 𝑦𝑦 2𝑛𝑛 is divisible by 𝑥𝑥 + 𝑦𝑦 .

GRADE 12 MATHEMATICS
P a g e | 15 Aung Pan Tine (Education Center) [Link]

(1) For 𝑛𝑛 = 1, 𝑥𝑥 2 − 𝑦𝑦 2 = (𝑥𝑥 + 𝑦𝑦)(𝑥𝑥 − 𝑦𝑦) which is divisible by 𝑥𝑥 + 𝑦𝑦 .

The statement is true for 𝑛𝑛 = 1.
(2) Assume that the statement is true for 𝑛𝑛 = 𝑘𝑘, that is
𝑥𝑥 2𝑘𝑘 − 𝑦𝑦 2𝑘𝑘 is divisible by 𝑥𝑥 + 𝑦𝑦 .
We will show that the statement is true for 𝑛𝑛 = 𝑘𝑘 + 1, that is we have to show that
𝑥𝑥 2(𝑘𝑘+1) − 𝑦𝑦 2(𝑘𝑘+1) is divisible by 𝑥𝑥 + 𝑦𝑦 .
𝑥𝑥 2(𝑘𝑘+1) − 𝑦𝑦 2(𝑘𝑘+1) = 𝑥𝑥 2𝑘𝑘+2 − 𝑦𝑦 2𝑘𝑘+2
= 𝑥𝑥 2𝑘𝑘 . 𝑥𝑥 2 − 𝑦𝑦 2𝑘𝑘 . 𝑦𝑦 2
= 𝑥𝑥 2𝑘𝑘 . 𝑥𝑥 2 − 𝑥𝑥 2 . 𝑦𝑦 2𝑘𝑘 + 𝑥𝑥 2 . 𝑦𝑦 2𝑘𝑘 −𝑦𝑦 2𝑘𝑘 . 𝑦𝑦 2
= 𝑥𝑥 2 (𝒙𝒙𝟐𝟐𝟐𝟐 − 𝒚𝒚𝟐𝟐𝟐𝟐 ) + 𝑦𝑦 2𝑘𝑘 (𝒙𝒙𝟐𝟐 − 𝒚𝒚𝟐𝟐 )
Since 𝒙𝒙𝟐𝟐𝟐𝟐 − 𝒚𝒚𝟐𝟐𝟐𝟐 is divisible by 𝑥𝑥 + 𝑦𝑦 and 𝒙𝒙𝟐𝟐 − 𝒚𝒚𝟐𝟐 is divisible by 𝑥𝑥 + 𝑦𝑦,
𝑥𝑥 2 (𝒙𝒙𝟐𝟐𝟐𝟐 − 𝒚𝒚𝟐𝟐𝟐𝟐 ) + 𝑦𝑦 2𝑘𝑘 (𝒙𝒙𝟐𝟐 − 𝒚𝒚𝟐𝟐 ) is divisible by 𝑥𝑥 + 𝑦𝑦.
So, 𝑥𝑥 2(𝑘𝑘+1) − 𝑦𝑦 2(𝑘𝑘+1) is divisible by 𝑥𝑥 + 𝑦𝑦 .
Therefore, the statement is true for 𝑛𝑛 = 𝑘𝑘 + 1.
(3) Hence, by principle of mathematical induction, the statement 𝑃𝑃(𝑛𝑛) is true for all natural
numbers 𝑛𝑛.
---------------------------------------------------------------------------------------------------------------------------

GRADE 12 MATHEMATICS