UNIVERSITY OF CAPE COAST

COLLEGE OF EDUCATION STUDIES

FACULTY OF SCIENCE AND TECHNOLOGY EDUCATION
DEPARTMENT OF MATHEMATICS AND ICT EDUCATION
EMA 202: ADVANCED ALGEBRA AND CALCULUS
LECTURER: DR. ISAAC BENNING

UNIT 5: MATHEMATICAL INDUCTION

Learning objectives
By the end of this unit, you should be able to prove that a given relation is true using mathematical
induction.

Principles of mathematical induction

Mathematical induction is one of the techniques which can be used to prove variety of
mathematical statements which are formulated in terms of n, where n is a positive integer. Proof
by mathematical induction involves four steps:
1. Show that the relation is true for n = 1.
2. Assume the relation is true for n = k
3. Show that the relation is true for n = k + 1
4. Draw a conclusion by restating the problem.

Example 1
3𝑛(𝑛+1)
Prove by mathematical induction that 3 + 6 + 9 + 12 + ⋯ + 3𝑛 = .
2
Solution
Step1: Show that the statement is true when 𝑛 = 1
3(1)(1 + 1)
3(1) = =3
2
Thus, the statement is true for 𝑛 = 1
Step 2: Assume the statement is true for 𝑛 = 𝑘
3𝑘(𝑘 + 1)
3 + 6 + 9 + 12 + ⋯ + 3𝑘 =
2
Step 3: Show that the statement is true when 𝑛 = 𝑘 + 1
3(𝑘 + 1)(𝑘 + 2)
3 + 6 + 9 + 12 + ⋯ + 3𝑘 + 3(𝑘 + 1) =
2
Considering the LHS
3(𝑘 + 1)
3 + 6 + 9 + 12 + ⋯ + 3𝑘 + 3(𝑘 + 1) = + 3(𝑘 + 1)
2
3𝑘(𝑘 + 1) + 6(𝑘 + 1)
=
2

1
 3(𝑘 + 1)(𝑘 + 2)
=
2
𝐿𝐻𝑆 = 𝑅𝐻𝑆
Step 4: Therefore, the statement is true for all 𝑛 ∈ 𝑁.

Example 2
𝑛
1
Prove by mathematical induction that ∑ 𝑟 = 2 𝑛(𝑛 + 1).
𝑟=0
Solution
𝑛
1
∑𝑟 = 1+ 2 + 3+ ⋯+ 𝑛 = 𝑛(𝑛 + 1)
2
𝑟=0

Step 1: Show the statement is true when 𝑛 = 1

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

LHS = RHS, thus this is true when 𝑛 = 1

Step 2: Assume the relation is true for 𝑛 = 𝑘
1
1 + 2 + 3 + ⋯ + 𝑘 = 𝑘(𝑘 + 1)
2
Step 3: Show that the relation is true for 𝑛 = 𝑘 + 1
1
1 + 2 + 3 + ⋯+ 𝑘 + 𝑘 + 1 = (𝑘 + 1)(𝑘 + 1 + 1)
2
Considering the LHS
1 𝑘(𝑘 + 1) + 2(𝑘 + 1)
𝑘(𝑘 + 1) + 𝑘 + 1 =
2 2
(𝑘 + 1)(𝑘 + 2) 1
= (𝑘 + 1)(𝑘 + 1 + 1)
2 2
𝐿𝐻𝑆 = 𝑅𝐻𝑆
Step 4: Therefore, by mathematical induction, the relation is true for all 𝑛 ∈ 𝑁

Example 3
𝑛
Prove by mathematical induction that∑𝑟=1(2r − 1) = 𝑛2

Solution
1 + 3 + 5 + 7 + ⋯ + (2𝑛 − 1) = 𝑛2
Step 1: show that the statement is true for when 𝑛 = 1

2
 1 = 12 = 1
Thus, the statement is true for 𝑛 = 1.
Step 2: Assume the statement is true for 𝑛 = 𝑘
1 + 3 + 5 + 7 + ⋯ + (2𝑘 − 1) = 𝑘 2
Step 3: Show that the statement is true for 𝑛 = 𝑘 + 1
1 + 3 + 5 + 7 + ⋯ + (2𝑘 − 1) + [2(𝑘 + 1) −] = (𝑘 + 1)2
Considering the LHS
𝑘 2 + [2(𝑘 + 1) − 1] = 𝑘 2 + 2𝑘 + 1
= (𝑘 + 1)2
𝐿𝐻𝑆 = 𝑅𝐻𝑆
Step 4: Therefore, by mathematical induction, the statement is true for all 𝑛 ∈ 𝑁.

Example 4
𝑛
1
Prove by mathematical induction that∑ 𝑟 2 = 6 𝑛(𝑛 + 1)(2𝑛 + 1).
𝑟=1

Solution
1
1 + 4 + 9 + ⋯ + 𝑛2 = 𝑛(𝑛 + 1)(2𝑛 + 1)
6
Step 1: Show that the statement is true when 𝑛 = 1
1
1= (1)(1 + 1)(2(1) + 1) = 1
6
Thus, the statement is true for 𝑛 = 1
Step 2: Assume that the statement is true for 𝑛 = 𝑘.
1
1 + 4 + 9 + ⋯ + 𝑘 2 = 𝑘(𝑘 + 1)(2𝑘 + 1)
6
Step 3: Show the statement is true for 𝑛 = 𝑘 + 1
1
1 + 4 + 9 + ⋯ + 𝑘 2 + (𝑘 + 1)2 = (𝑘 + 1)(𝑘 + 2)(2𝑘 + 3)
6
Considering the LHS
1 (𝑘 + 1)[𝑘(2𝑘 + 1) + 6(𝑘 + 1)]
𝑘(𝑘 + 1)(2𝑘 + 1) + (𝑘 + 1)2 =
6 6
(𝑘 + 1)[2𝑘 2 + 𝑘 + 6𝑘 + 6]
=
6
(𝑘 + 1)(2𝑘 2 + 7𝑘 + 6)
=
6

3
 (𝑘 + 1)(𝑘 + 2)(2𝑘 + 3)
=
6
𝐿𝐻𝑆 = 𝑅𝐻𝑆
Step 4: Therefore, by mathematical induction, the statement is true.

Example 5
1 1 1 1 𝑛
Prove that + + + ⋯+ =
1.2 2.3 3.4 𝑛(𝑛+1) 𝑛+1

Solution
1 1 1 1 𝑛
+ + +⋯+ =
1.2 2.3 3.4 𝑛(𝑛 + 1) 𝑛 + 1
Step 1: Show that the statement is true for 𝑛 = 1
1 1 1
= =
1.2 1 + 1 2
Thus, the statement is true for 𝑛 = 1
Step 2: Assume the statement is true for 𝑛 = 𝑘
1 1 1 1 𝑘
+ + +⋯+ =
1.2 2.3 3.4 𝑘(𝑘 + 1) 𝑘 + 1
Step 3: Prove that the statement is true for 𝑛 = 𝑘 + 1
1 1 1 1 1 𝑘+1
+ + +⋯+ + =
1.2 2.3 3.4 𝑘(𝑘 + 1) (𝑘 + 1)(𝑘 + 2) 𝑘 + 2
Considering the LHS
1 1 1 1 1 𝑘 1
+ + +⋯+ + = +
1.2 2.3 3.4 𝑘(𝑘 + 1) (𝑘 + 1)(𝑘 + 2) 𝑘 + 1 (𝑘 + 1)(𝑘 + 2)
𝑘(𝑘 + 2) + 1
=
(𝑘 + 1)(𝑘 + 2)
𝑘 2 + 2𝑘 + 1
=
(𝑘 + 1)(𝑘 + 2)
(𝑘 + 1)(𝑘 + 1)
=
(𝑘 + 1)(𝑘 + 2)
(𝑘 + 1)
=
(𝑘 + 2)
𝐿𝐻𝑆 = 𝑅𝐻𝑆
Step 4: therefore, by mathematical induction, the statement is true for all 𝑛 ∈ 𝑁.

4
Example 7
Prove by mathematical induction that 𝑎2𝑛 − 𝑏 2𝑛 is divisible by 𝑎 + 𝑏 when n is any positive
integer.

Solution
Step 1: If 𝑛 = 1, the statement is true since 𝑎2 − 𝑏 2 = (𝑎 + 𝑏)(𝑎 − 𝑏)
Step 2: Assume the statement is true for 𝑛 = 𝑘, then 𝑎2𝑘 − 𝑏 2𝑘 is divisible by 𝑎 + 𝑏
Step 3: We want to show that, 𝑎2𝑘+2 − 𝑏 2𝑘+2 is divisible by 𝑎 + 𝑏
𝑎2𝑘+2 − 𝑏 2𝑘+2 = 𝑎2 . 𝑎2𝑘 − 𝑏 2 . 𝑏 2𝑘
= 𝑎2 . 𝑎2𝑘 − 𝑎2 . 𝑏 2𝑘 + 𝑎2 𝑏 2𝑘 − 𝑏 2 . 𝑏 2𝑘 (add and subtract 𝑎2 . 𝑏 2𝑘 )
= 𝑎2 (𝑎2𝑘 − 𝑏 2𝑘 ) + 𝑏 2𝑘 (𝑎2 + 𝑏 2 )
It follows that, 𝑎2𝑘+2 − 𝑏 2𝑘+2 is divisible by 𝑎 + 𝑏. If 𝑎2𝑘 − 𝑏 2𝑘 is divisible by 𝑎 + 𝑏
Step 4: Therefore, by mathematical induction, 𝑎2𝑛 − 𝑏 2𝑛 is divisible by 𝑎 + 𝑏 for 𝑛 ∈ 𝑃.

Example 8
1
Prove by mathematical induction 1 + 5 + 52 + ⋯ + 5𝑛−1 = 4 (5𝑛 − 1).

Solution
Step 1: show that the statement is when 𝑛 = 1.
1
1= (5 − 1) = 1
4
Thus, the statement is true when 𝑛 = 1
Step 2: Assume the statement is for 𝑛 = 𝑘
1
1 + 5 + 52 + ⋯ + 5𝑘−1 = (5𝑘 − 1)
4
Step 3: We want to show that the statement is true for 𝑛 = 𝑘 + 1.
1 𝑘+1
1 + 5 + 52 + ⋯ + 5𝑘−1 + 5𝑘 = (5 − 1)
4
Considering the LHS
1
1 + 5 + 52 + ⋯ + 5𝑘−1 + 5𝑘 = 4 (5𝑘 − 1) + 5𝑘

5𝑘 − 1 + 4.5𝑘
=
4
5𝑘 + 4.5𝑘 1
= −
4 4
5
 5𝑘 (1 + 4) 1
= −
4 4
5𝑘 . 5 1
= −
4 4
5𝑘+1 1
= −
4 4
1
= (5𝑘+1 − 1)
4
𝐿𝐻𝑆 = 𝑅𝐻𝑆
Step 4: By mathematical induction, the statement is true for all 𝑛 ∈ 𝑁

Example 9
5 6 7 𝑛+4 𝑛(3𝑛+7)
Prove by mathematical induction that + + + ⋯+ = .
1.2.3 2.3.4 3.4.5 𝑛(𝑛+1)(𝑛+2) 2(𝑛+1)(𝑛+2)

Solution
Step 1: Show that the statement is true when 𝑛 = 1.
5 1(3(1)+7) 10 5
= = =
1.2.3 2(1+1)(1+2) 12 6

Thus, the statement is true for 𝑛 = 1

Step 2: Assume the statement is true for 𝑛 = 𝑘
5 6 7 𝑘+4 𝑘(3𝑘 + 7)
+ + + ⋯+ =
1.2.3 2.3.4 3.4.5 𝑘(𝑘 + 1)(𝑘 + 2) 2(𝑘 + 1)(𝑘 + 2)
Step 4: When the statement is true for 𝑛 = 𝑘 + 1
5 6 7 𝑘+4 𝑘+5 (𝑘 + 1)(3𝑘 + 10)
+ + + ⋯+ + =
1.2.3 2.3.4 3.4.5 𝑘(𝑘 + 1)(𝑘 + 2) (𝑘 + 1)(𝑘 + 2)(𝑘 + 3) 2(𝑘 + 2)(𝑘 + 3)
Considering the LHS
5 6 7 𝑘+4 𝑘+5
+ + + ⋯+ +
1.2.3 2.3.4 3.4.5 𝑘(𝑘 + 1)(𝑘 + 2) (𝑘 + 1)(𝑘 + 2)(𝑘 + 3)
𝑘(3𝑘 + 7) 𝑘+5
= +
2(𝑘 + 1)(𝑘 + 2) (𝑘 + 1)(𝑘 + 2)(𝑘 + 3)
𝑘(3𝑘 + 7)(𝑘 + 3) + 2(𝑘 + 5)
=
2(𝑘 + 1)(𝑘 + 2)(𝑘 + 3)
𝑘(3𝑘 + 7)(𝑘 + 3) + 2𝑘 + 10
=
2(𝑘 + 1)(𝑘 + 2)(𝑘 + 3)
3𝑘 3 + 16𝑘 2 + 23𝑘 + 10
=
2(𝑘 + 1)(𝑘 + 2)(𝑘 + 3)

6
 (𝑘 + 1)2 (3𝑘 + 10)
=
2(𝑘 + 1)(𝑘 + 2)(𝑘 + 3)
(𝑘 + 1)(3𝑘 + 10)
=
2(𝑘 + 2)(𝑘 + 3)
𝐿𝐻𝑆 = 𝑅𝐻𝑆
Therefore, by mathematical induction the statement is true.

EXERCISE
Prove by mathematical induction, n is a positive integer.
3 4 5 𝑛+2 1
(a) 1.2.2 + 2.3.22 + 2.4.23 + ⋯ + 𝑛(𝑛+1)2𝑛 = 1 − (𝑛+1)2𝑛
1
(b) 1.2 + 2.3 + 3.4 + 4.5 + ⋯ + 𝑛(𝑛 + 1) = 3 𝑛(𝑛 + 1)(𝑛 + 2)
𝑛(𝑛−1) 𝑛(𝑛−1)…(𝑛−𝑟+2) 𝑛−𝑟+1 𝑟−1
(c) (𝑎 + 𝑥)2 = 𝑎𝑛 + 𝑛𝑎𝑛−1 𝑥 + 𝑎𝑛−2 𝑥 2 + ⋯ + (𝑛−1)
𝑎 𝑥 + ⋯ + 𝑥𝑛
2!
𝑛2 (𝑛+1)2
(d) 13 + 23 + 33 + ⋯ + 𝑛3 = 4
2 𝑛−1 3𝑛 −1
(e) 1 + 3 + 3 + ⋯ + 3 = 2
(2𝑛−1)3𝑛+1 +3
(f) 1.3 + 2. 3 + 3. 3 + ⋯ + 𝑛. 3𝑛 =
2 3
4