CHAPTER FOUR

PRINCIPLES OF MATHEMATICAL INDUCTION (PMI)

Sometimes we want to prove that a statement about positive integers is true for all positive
integers or infinite sequence of consecutive integers. To prove we need the Principle of
Mathematical Induction.
i) P(1)is true .
ii) If P(k ) istrue , then P(k +1)is alsotrue
Then , P (n)is true for all n element Z +.
n
n(n+1)
Example 1. Prove that ∑ i ¿
i=1 2

Proof:
(k + 1)(k +2)
Goal:
2
i)P (1) is true, that is for n = 1.
n
LHS: ∑i = 1 + 2 + 3 + 4 + . . . + n
i=1

n(n+1) 1(1+ 1) 2
RHS: = = =1
2 2 2
For n = 2,
LHS: n = 1 + 2 = 3
2(2+1) 2(3) 6
RHS: = = =3
2 2 2
For n = 3,
LHS: 1 + 2 +3 = 6
3(3+1) 3(4 ) 12
RHS: = = =6
2 2 2
ii)If P (k ) is true, then the statement becomes
k (k+ 1)
1+2+3+4+...+k= . Assuming that P (k + 1) is also true, that
2
is,
 k (k+ 1)
1 + 2 + 3 + 4 + . . . + k + (k + 1) = + (k + 1)
2
k ( k +1 ) +2(k+ 1)
= (by LCD)
2
( k +1 ) (k + 2)
= (Factoring Common terms)
2
∴ P (n) is true ∀ n∈ ℤ+.
n
Example 2. Prove that ∑ (2 i−1 ) = n 2

i=1

Proof:
Goal: (k + 1)2
i)P(1) is true that is for n = 1
n
LHS: ∑ (2 i−1 ) =〔2(1)-1〕+〔2(2) -1〕+〔2(3) - 1〕+. . .+〔2(n) - 1〕
i=1

= 1 + 3 + 5 + . . . + (2n – 1)
= 2(1) – 1
=1
RHS: n2 = 12 = 1
ii)If P (k) is true then the statement becomes
1 + 3 + 5 + . . . + (2k – 1) = k2.
By assumption, P (k + 1) is also true, that is
1 + 3 + 5 + . . . + (2k – 1) +〔2 (k + 1) – 1 = k2 +〔2(k + 1) - 1〕
= k 2 + 2k + 1 (by dist.
Property)
= (k + 1)(k + 1) (by factoring)
= (k + 1)2
∴ P (n) is true ∀ n∈ ℤ+.
n
Example 3. Prove that ∑ i 3 ¿ n2 (n + 1)2
i=1
4
Proof:
 Goal: (k + 1)2 (k + 2)2
4
i)P (1) is true, that is for n = 1.
n
LHS: ∑ i 3 = 13 + 23 + 33 + . . . + n3
i=1

= n3
= 13
=1

RHS : n2 (n + 1)2 = 12 (1 + 1)2 = 22 = 4 = 1

4 4 4 4

ii)If P (k ) is true, then the statement becomes

13 + 23 + 33 + . . . + k3 = k2 (k + 1)2
4
By Assumption P (k + 1) is also true, that is,

13 + 23 + 33 + . . . + k3 + (k + 1)3 = k2 (k + 1)2 + (k + 1)3

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

4
= (k + 1) 〔k2+4 (k + 1) 〕
2

4
= (k + 1) 〔k2+4 k + 4 〕
2

4
2
= (k + 1) (k + 2)(K + 2)
4
= (k + 1) (k + 2)2
2

∴ P (n) is true ∀ n∈ ℤ+.

Example 4. Prove that 7 divides 23n – 1
Proof:
i)P (1) is true, that is,

7∣ 23n – 1
⇒ 7 ∣ 23(1) – 1
⇒ 7 ∣ (23 – 1)
⇒ 7 ∣ (8 – 1)
⇒7∣7
= 1
 ii)If P (k) is true, i. e ,

7 ∣ 23k – 1 then P (k + 1) is also true, hence show,

7 ∣ 23(k + 1) – 1

To show,
If 7∣ 23k – 1 ⇒ ∃ m ∋ m = 23k – 1 ∀ m ∈ Z+
7
3k
⇒ 7m = 2 – 1
⇒ (7m = 2 3k – 1) (23)
⇒ 7m (23) = 2 3k 23– 23
⇒ 7m (8) = 2 3k + 3 – 8

⇒ 56m = 2 3(k + 1) – 8
⇒ 56m + 7= 2 3(k + 1) – 8 + 7
⇒ 7(8m + 1) = 2 3(k + 1) – 1
Letting p = (8m + 1), then we have,
7p = 2 3(k + 1) – 1 ∀ p ∈ Z+
⇒ 7 ∣ 23(k + 1) – 1

∴ P (n) is true ∀ n∈ ℤ+.

Example 5. Prove that 8 divides 32n + 7

Proof:
i) P (1) is true, that is,

8 ∣ 32n + 7
⇒ 8 ∣ 32(1) + 7
⇒ 8 ∣ (32 + 7)
⇒ 8 ∣ (9 + 7)
⇒ 8 ∣ 16
= 2

ii) If P (k) is true, i. e ,

8 ∣ 32k + 7 then P (k + 1) is also true,

That is,
8 ∣ 32(k + 1) + 7

To show,
If 8∣ 32k + 7 ⇒ ∃ m ∋ m = 32k + 7 ∀ m ∈ Z+
8
 ⇒ 8m = 3 2k + 7
⇒ (8m = 3 2k + 7) (32)
⇒ 8m (32) = 3 2k 32 +7(32)
⇒ 8m (9) = 3 2(k + 1) + 7(9)
⇒ 72m = 3 2(k + 1) + 63
⇒ 72m – 56 = 3 2(k + 1) + 63 - 56
⇒ 8(9m - 7) = 3 2(k + 1) + 7
Letting p = (9m - 7), then we have,
8p = 3 2(k + 1) + 7 ∀ p ∈ Z+
⇒ 8 ∣ 32(k + 1) + 7

∴ P (n) is true ∀ n∈ ℤ+.

EXERCISES

1. Find the summation of the following;

10 5
a) ∑ i2 d) ∑ 3 2 i
i=1 i=1
n 6
b) ∑i 4
e) ∑ (i−4 )
i=1 i=1
8
c) ∑ (2 i+3 )
i=1

n
2. Prove that ∑ i 2 = n(n + 1)(2n +1)
i=1
6
n
3. Prove that ∑i 4
= n(n + 1)(2n +1) (3n2 + 3n – 1)
i=1
30
n
4. Prove that ∑ ¿¿ 2
- 2i) = 2n3 +n2 - n
i=1
2
2n
5. Prove that 11∣ 5 - 3
6. Prove that 4 ∣ 72n + 5
7. Show that S has 2n subsets.