Principle of Mathematical Induction

Principle of Mathematical Induction

The principle states that: If P(1) is true and the
hypothesis that P(k) is true for a particular k, is
sufficient to ensure that it is also true for P(k + 1).
Then, P(n) is true for every positive integer n.
Examples
Use the mathematical induction to show that
n(n + 1)(n + 2)
1. 1.2 + 2.3 + · · · + n(n + 1) = .
3
2. 9 is a factor of 52n + 3n − 1.
3. 7 is a factor of 43n−1 + 23n−1 + 1.
4. 7 divides 25n+3 + 34n+3 .
 5. 32n+2 − 8n − 9 is divisible by 64.
n
(2k − 1)3 = n2 (2n2 − 1).
P
6.
k=1
n n(2n − 1)(2n + 1)
(2k − 1)2 =
P
7. .
k=1 3
Solution 1
n(n + 1)(n + 2)
1.2 + 2.3 + · · · + n(n + 1) = .
3
Let P(n) be the statement
n(n + 1)(n + 2)
1.2 + 2.3 + · · · + n(n + 1) =
3
If n = 1, LHS = 1(1 + 1) = 1(2),
 1(1 + 1)(1 + 2)
RHS =
3
1(2)(3)
=
3
= 1(2)
= LHS

Thus, P(1) is true. Now, assume that P(k) is true

i.e;
k(k + 1)(k + 2)
1.2 + 2.3 + · · · + k(k + 1) = .
3
We then show that P(k + 1) is also true.
Put n = k + 1.

LHS = (1.2+2.3+· · ·+k(k+1))+(k+1)(k+2)......(∗),

but
k(k + 1)(k + 2)
1.2 + 2.3 + · · · + k(k + 1) = .
3
Thus, equation (∗) becomes
(1.2 + 2.3 + · · · + k(k + 1)) + (k + 1)(k + 2)
 k(k + 1)(k + 2)
= + (k + 1)(k + 2)
3
k(k + 1)(k + 2) + 3(k + 1)(k + 2)
=
3
(k + 1)(k + 2)(k + 3)
=
3

Solution 2
9 is a factor of 52n + 3n − 1.
When n = 1, 52n + 3n − 1 = 52 + 3 − 1 = 9 × 3.
So, P(n) is true.
Assume that P(k) is true, i.e;
52k + 3k − 1 = 9N, N an integer.
Thus,
52k = 9N − 3k + 1.........(∗∗)
To show that P(k + 1) is also true, put n = k + 1

52(k+1) + 3(k + 1) − 1 = 52k .52 + 3k + 2

= 52 (9N − 3k + 1) + 3k + 2
= 52 .9N − 52 .3k + 52 + 3k + 2
= 52 .9N − 75k + 25 + 3k + 2
= 52 .9N − 72k + 27
= 9(25N − 8k + 3)
Hence, 9 is a factor of 52n + 3n − 1.
Solution 3
7 is a factor of 43n−1 + 23n−1 + 1.
For n = 1, 42 + 22 + 1 = 7 × 3. So, P(1) is true.
Suppose that n = k,

43k−1 + 23k−1 + 1 = 7N

This implies,

43k + 23k .2 + 4 = 7N.4

Thus, 43k = 7N.4 − 2.23k − 4
For n = k + 1,

43(k+1)−1 + 23(k+1)−1 + 1 = 43k+2 .23k+2 + 1

= 43k .42 + 23k .22 + 1
= 42 (7N.4 − 2.23k − 4)
+23k .22 + 1
= 448N − 32.23k − 64
+23k .22 + 1
= 448N − 23k (32 − 4) − 63
= 7(64N − 4.23k − 9)
Hence, 7 is a factor of 43n−1 + 23n−1 + 1.
Solution 4
7 divides 25n+3 + 34n+3 .
For n = 1,

25(1)+3 + 34(1)+3 = 28 + 37 = 7.349.

So, P(1) is true.
Assume n = k,
25k+1 + 34k+3 = 7D, D an integer.
This implies 25k .23 + 34k .33 .
For n = k + 1,

25(k+1)+3 + 44(k+1)+3 = 25k .25 .23 + 34k .34 .33

= 25 (7D − 34k .33 ) + 34k .37
= 7D.25 − 34k .34 .25 + 34k .37
= 7D.25 − 34k .34 (25 − 34 )
= 7D.25 − 34k .34 (−49)
= 7D.25 + 34k .34 .72
= 7(32D + 34k .189)
Hence, 7 divides 25n+3 + 34n+3 .
Solution 5
32n+2 − 8n − 9 is divisible by 64.
For n = 1, 34 − 8 − 9 = 81 − 17 = 64.
Thus, P(1) is true.
Assume n = k,

32k+2 − 8k − 9 = 64N, N an interger.

This implies 32k .32 = 64N + 8k + 9.

For n = k + 1,
32(k+1)+2 − 8(k + 1) − 9 = 32k .32 .32 − 8k − 8 − 9
= 32 (64N + 8k + 9) − 8k
−17
= 9.64N + 72k + 81 − 8k
−17
= 9.64N + 64k + 64
= 64(9N + k + 1)
i.e, P(k + 1) is true. Hence, 32n+2 − 8n − 9 is
divisible by 64.
Solution 6
n
(2k − 1)3 = n2 (2n2 − 1).
P
k=1
For n = 1,
LHS = (2 − 1)2 = 1,
RHS = 1(2 − 1) = 1.
Thus, P(1) is true.
k
(2r − 1)3 = k 2 (2k 2 − 1).
P
Assume n = k,
r =1
For n = k + 1,
LHS
k+1
X k
X
3
(2(r + 1) − 1) = (2r − 1)3 + (2(k + 1) − 1)3
r =1 r =1
= k (2k 2 − 1) + (2(k + 1) − 1)3
2

= k 2 (2k 2 − 1) + 8k 3 + 12k 2
+ 6k + 1
= 2k 4 + 8k 3 + 11k 2 + 6k + 1
RHS

(k + 1)2 (2((k + 1)2 ) − 1) = (k 2 + 2k + 1)

(2k 2 + 4k + 1)
= 2k 4 + 8k 3 + 11k 2 + 6k
+1
= LHS
i.e P(k + 1) is true. Hence, by the principle of
n
(2k − 1)3 = n2 (2n2 − 1).
P
mathematical induction
k=1
Solution 7
n n(2n − 1)(2n + 1)
(2k − 1)2 =
P
.
k=1 3
For n = 1, LHS = 1, RHS = 1. Thus, P(1) is true.
k k(2k − 1)(2k + 1)
(2r − 1)2 =
P
Assume n = k, .
r =1 3
For n = k + 1, LHS
k+1
X k
X
2
(2(r + 1) − 1) = (2r − 1)2 + (2(k + 1) − 1)2
r =1 r =1
k(2k − 1)(2k + 1)
=
3
2
+ 4k + 4k + 1
k(2k − 1)(2k + 1)
=
3
2
3(4k + 4k + 1)
+
3
4k + 12k 2 + 11k + 3
3
=
3
RHS

(k + 1)(2(k + 1) − 1)(2(k + 1) + 1)
3

(k + 1)(4(k + 1)2 − 1)
=
3
(k + 1)(4k 2 + 8k + 3)
=
3
3 2
4k + 12k + 11k + 3
=
3
= LHS
n n(2n − 1)(2n + 1)
(2k − 1)2 =
P
Hence, .
k=1 3
Quiz
Use mathematical induction to prove that
1. 1 + 3 + 5 + · · · + 2n − 1 = n2
1 1 1 1 n
2. + + + ··· + =
1.2 2.3 3.4 n(n + 1) n + 1
Assignment
(A) Use mathematical induction to prove that
n(n + 1)(2n + 7)
1. 1.3+2.4+3.5+· · ·+n(n+2) =
6
2 2 2
2. 1.2 + 2.3 + · · · + n(n + 1) =
n(n + 1)(n + 2)(3n + 5)
12
Pn
5 n (n + 1)2 (2n2 + 2n − 1)
2
3. k = .
k=1 12
(B) Prove that for all integers n:
4. 15 is a factor of 24n − 1
5. 72n + 2 is an integer multiple of 8.
Submission: 10/11/22. One copy per
Department.