MATHEMATICS- IA WWW.AIMSTUTORIAL.

IN

2. MATHEMATICAL INDUCTION
DEFINITIONS, CONCEPTS AND FORMULAE:

1) Principle of finite Mathematical Induction : 2. Prove that 1.2.3+2.3.4+3.4.5+..........upto

Let P(n) be a statement for each n  N. If n(n+1)(n+2)(n+3)
n terms = n  N .
i) P(1) is true 4
ii) P(k) is true  P(k + 1) is true, P(n) is true A: Let P(n) be the given statement:
for all n N. 1.2.3 + 2.3.4 + 3.4.5+............+n(n+1)(n+2)
If P is a subset of N such that (i) 1P and n(n+1)(n+2)(n+3)
(ii) k  P k+ 1 P then P = N. It is called =
4
principle of finite mathematical induction. If n=1, LHS = 1.2.3
n(n + 1) =6
2) 1 + 2 + 3 + ........ + n = 2
.
RHS = 1.2.3.4
4
n(n + 1) (2n + 1)
3) 1 + 2 + 3 + ...... + n =
2 2 2 2
6
.
=6
 LHS = RHS.
4) 13 + 23 + 33 + ...... + n3 = n (n + 1) .
2 2

4 Thus P(1) is TRUE.

Assume that P(k) is true.
 1.2.3 + 2.3.4 + 3.4.5+...........+k(k+1)(k+2)=
LEVEL - I (LAQ) k(k+1)(k+2)(k+3)
4
1. By induction, prove that 43 + 83 + 123 + ........ Adding (k+1) (k+2) (k+3) on both sides, we get
upto n terms = 16n2 (n+1)2. 1.2.3+2.3.4+3.4.5+..........+k(k+1)(k+2)+(k+1)(k+2)(k+3)
A: Let P(n) be the given statement: k(k+1)(k+2)(k+3)
= +(k+1)(k+2)(k+3)
4 + 8 + 12 + .............+ (4n) = 16n (n+1)
3 3 3 3 2 2 4
If n = 1, LHS = 43 k(k+1)(k+2)(k+3)+4(k+1)(k+2)(k+3)
=
4
= 64
RHS = 16(12) (22) (k+1)(k+2)(k+3)[k+4]
=
4
= 64
 LHS = RHS. = (k+1)(k+1+1)(k+1+2) (k+1+3)
4
Thus P(1) is TRUE. Thus P(k+1) is TRUE.
Assume that P(k) is true. Hence, by the principle of mathematical induction
the given statement is true for all n  N.
 43 + 83 + 123 + .............+(4k)3 = 16k2 (k+1)2
Adding [4(k+1)]3 on both sides, we get 3. By induction, prove that
43 + 83 + 123 + ...............+(4k)3 + [4(k+1)]3 n
a+(a+d)+(a+2d)+........upto nterms = 2 [2a+(n-1)d]
= 16k2 (k+1)2 + 64(k+1)3 A: Let P(n) be the statement:
= 16(k+1)2 [k2 + 4(k+1)] n
a+(a+d)+(a+2d)+.........+[a+(n-1)d]= 2 [2a+(n-1)d].
= 16(k+1) (k + 4k + 4)
2 2
If n=1, LHS = a
= 16 (k+1)2 (k+2)2
RHS = 2 1 [2a+0.d]
= 16 (k+1)2 (k+1+1)2
Thus P(k+1) is TRUE. =a
 LHS = RHS.
Hence, by the principle of mathematical induction
Thus P(1) is TRUE.
the given statement is true for all n  N.

Mathematical Induction 1
MATHEMATICS- IA WWW.AIMSTUTORIAL.IN
Assume that P(k) is true.
 a+(a+d) + (a+2d)+.........+[a+(k-1)d] 5. Show that 1 2+(1 2+2 2)+(1 2+2 2+3 2)+.........upto
n(n+1)2 (n+2)
= k2 [2a+(k-1)d] n terms =
12
for all nN.
Adding a+kd on bothsides, we get A: Let P(n) be the given statement:
a+(a+d)+(a+2d)+.............+[a+(k-1)d]+(a+kd) 12+(12+22) + (12+22+32)+ ...........+(12+22+32+......+n2)

= k2 [2a+(k-1)d]+(a+kd) =
n(n+1)2 (n+2)
12
k[2a+(k-1)d]+2(a+kd) n(n+1)(2n+1)
= 3k2 + 4k+1 i.e.12+(12+22)+(12+22+32)+.............+
6
2
= 3k2+3k+k+1
2ak+k(k-1)d+2a+2kd = 3k(k+1)+1(k+1) n(n+1)2 (n+2)
= =
2 12
= (3k+1) (k+1) If n = 1, LHS = 12
2a(k+1)+kd(k-1+2) = 1
=
2
(k+1) RHS = 1.2.3
6
= (2a + kd)
2 =1
 LHS = RHS
(k+1)
= [2a+ (k+1 - 1) d] Thus P(1) is TRUE.
2
Assume that P(k) is true.
Thus P(k+1) is TRUE.
Hence, by the principle of mathematical induction, k(k+1)(2k+1)
 12 + (12+22) + (12+22+32) + ...........+
the given statement is true for all n N. 6

k(k+1)2 (k+2)
4. Using Induction, for all n  N, prove that =
12
a(rn -1)
a+ar+ar2+...............upto nterms = ; r  (k+1)(k+2)(2k+3)
r-1 Adding on both sides, we get
1. 6
A: Let P(n) be the given statement: k(k+1)(2k+1) (k+1)(k+2)(2k+3)
12+(12+22)+..............+ 6
+ 6
a(rn -1)
a +ar+ar2+.............+arn-1 =
r-1
If n=1, LHS = a k(k+1)2 (k+2) (k+1)(k+2)(2k+3)
= 
a( r-1 ) 12 6
RHS =
r-1
=a k(k+1)2 (k+2)+2(k+1)(k+2)(2k+3)
=
 LHS = RHS. 12
Thus P(1) is TRUE. (k+1)(k+2)[k(k+1)+2(2k+3)]
Assume that P(k) is true. =
12
k
 a + ar + ar2 + ...........+ ark-1 = a(r -1) (k+1)(k+2)(k 2 +5k+6)
r-1 = k2 + 5k + 6
Adding ark on bothsides, we get 12
a + ar + ar2 + ........+ark-1 + ark = k2 + 2k + 3k + 6
k = k(k+ 2) +3(k + 2)
= a(r -1) +ark = (k + 2) (k + 3)
r-1
k k (k+1)(k+2)(k+2)(k+3)
= a[r - 1 + r (r-1)] =
12
r -1
k k+1 k (k+1)(k+2)2 (k+3)
= a[ r - 1 + r - r ] =
r -1 12
k+1 (k+1)[k+1+1]2 [k+1+2]
= a[r -1) =
12
r -1
Thus P(k+1) is TRUE. Thus P(k+1) is TRUE.
Hence, by the principle of mathematical induction, Hence, by the principle of mathematical induction,
the given statement is true for all n  N. the given statement is true for all n  N.
Mathematical Induction 2
MATHEMATICS- IA WWW.AIMSTUTORIAL.IN
6. Using the principle of mathematical
7. Using the principle of mathematical induction,
induction, prove that
prove that 2.3+3.4+4.5+....... upto n terms =
13 + 13 +23 + 13 +23 +33 +..........+upto n terms =
1 1+3 1+3+5 n(n2 +6n+11)
for all nN.
3
n
24 [2n +9n+13].
2
A: Let P(n) be the given statement:
n(n2 +6n+11)
2.3+3.4+4.5+..............+(n+1)(n+2) =
A: nth term = 3
 n2 (n+1)2 
2, 3, 4 ..... (n+1)
 
  3, 4, 5,...... (n+2)
 4  (n+1)2
13 +23 +33 +..........+n3   If n = 1, LHS = 2.3
1+3+5+........+(2n-1) n2 4 =6
Let P(n) be the given statement.
1(1+6+11)
RHS =
2
13  13+23  13 +23 +33  ..........  (n+1)  n [2n2 + 9n +13] 3
1 1+3 1+3+5 4 24 =6
13  LHS = RHS.
If n =1, LHS =
1 Thus P(1) is TRUE.
= 1. Assume that P(k) is true.
1 [2+9+13]  2.3 + 3.4+4.5+.............+(k+1) (k+2)
RHS = 24
k(k2 +6k+11)
=
= 2424
3
Adding (k +2)(k+3) on both sides, we get
= 1.
2.3+3.4+4.5+.........+(k+1)(k+2)+(k+2)(k+3)
 LHS = RHS.
Thus P(1) is TRUE. k(k2 +6k+11)
= +(k+2) (k+3)
Assume that P(k) is true. 3
 13  13 +23  13 +23 +33  ..........  (k+1)2  k [2k 2 + 9k + 13] k3 +6k 2 +11k+3(k 2 +5k+6)
1 1+3 1+3+5 4 24 =
3
2
By Synthetic division
Adding (k+2) on both sides, we get 3 2
4 = k +9k +26k+18 1 9 26 18
3
2 2
13  13 +23  13 +23 +33  ..........  (k+1)  (k+2) -1 0 -1 -8 -18
1 1+3 1+3+5 4 4 (k+1)(k 2 +8k+18)
= 1 8 18 0
3
k [2k2+9k+13] + (k+2)2
= 24
4 (k+1)[k 2 +2k+1+6k+6+11]
=
k(2k2 +9k+13)+6(k+2)2 3
=
24 (k+1)[(k+1)2 +6(k+1)+11]
=
3 2 2 3
= 2k +9k +13k+6k +24k+24
24 By Synthetic division Thus P(k+1) is TRUE.

= 2k 3 +15k 2 +37k+24 2 15 37 24 Hence, by the principle of mathematical induction

24 given statement is true for all n N.
(k+1) (2k2 +13k+24)-1 0 -2 -13 -24
=
24 2 13 24 0 8. Prove that 2+3.2 + 4.22 + ........upto n terms =
2 n.2n for all n N.
(k+1)[2k +4k+2+9k+9+13]
= 2, 3, 4, ........... n+1
24
1, 2, 22, ......... 2n-1
(k+1)[2(k+1)2 +9(k+1)+13] A: Let P(n) be the given statement :
=
24 2.1 + 3.2 + 4.22 + ............+(n+1).2n-1 = n.2n
 P(k+1) is TRUE. If n =1, LHS = 2.1
Hence, by the principle of mathematical induction, =2
the given statement is true for all n N.
Mathematical Induction 3
MATHEMATICS- IA WWW.AIMSTUTORIAL.IN
RHS = 2.21-1
=2 (3k+1) (k+1)
 LHS = RHS =
(3k+1) (3k+4)
Thus P(1) is TRUE.
Assume that P(k) is true. k+1
 2.1 + 3.2 + 4.22 + ...........+(k+1)2k-1 = k.2k =
3(k+1)+1
Adding (k+2)2k on both sides, we get
2.1 + 3.2 + 4.22 + ...........+(k+1)2k-1 + (k+2) 2k Thus P(k+1) is TRUE.
= k.2k + (k+2)2k
Hence, by the principle of mathematical induction
= (k+k+2)2k
the given statement is true for all n  N.
= 2(k+1). 2k
= (k+1). 2k+1 10.Show that 49n + 16n - 1 is divisible by 64 for all
Thus P(k+1) is TRUE. positive integers n.
Hence, by the principle of mathematical induction A: Let P(n) be the statement:
the given statement is true for all n  N. 49n + 16n-1 is divisible by 64.
If n =1, 49n + 16n-1 = 49+16 -1
1 1 1
9. Show that 1.4 + 4.7 + 7.10 +...... upto n terms =
= 64
= 64(1)
n Thus the statement is true for n =1.
3n + 1 for all n  N.
Let P(n) be the statement: Assume that P(k) is true
 49k + 16k -1 is divisible by 64
1 1 1 1 n
A: 1.4  4.7  7.10  ...........  (3n-2)(3n+1)  3n+1  49k + 16k -1 = 64t, for some t  N
1
 49k = 64t - 16k +1 ...............(1)
If n =1, LHS = 1.4 Consider 49k+1 + 16(k+1)-1
= 49.49k + 16k +15
= 41
= 49[64t - 16k +1] + 16k + 15
1
RHS = 3+1 = 64 (49t) - 16k(49)+16k+ 49 +15
= 64 (49t) - 16k (49-1) + 64
= 41 = 64 (49t) -16k(4)(12) + 64
 LHS = RHS. = 64[49t - 12k +1]
Thus P(1) is TRUE.  The statement is true for n = k + 1.
Assume that P(k) is true. Hence, by the principle of mathematical induction
49n + 16n -1 is divisible by 64  n  N.
1 1 1 1 k
 1.4  4.7  7.10  ...........  (3k-2)(3k+1)  3k+1
12.Using mathematical induction, prove that
1
Adding (3k+1)(3k+4) on bothsides, we get
2.42n+1 + 33n+1 is divisible by 11,  n  N.
1  1  1  ...........  1  1 A: Let P(n) be the statement:
1.4 4.7 7.10 (3k-2)(3k+1) (3k+1)(3k+4)
2.42n+1 + 33n+1 is divisible by 11
k 1
= 3k+1  (3k+1)(3k+4) If n =1, 2.42n+1 + 33n+1 = 2.42+1 + 33+1

k(3k+4)+1 = 2(64) + 81
= (3k+1)(3k+4)
= 209
3k2 +4k+1 = 11(19)
= (3k+1)(3k+4)
Thus the statement is true for n =1.

Mathematical Induction 4
MATHEMATICS- IA WWW.AIMSTUTORIAL.IN
Assume that P(k) is true. 12.Using mathematical induction prove that
 2.42k+1 + 33k+1 is divisible by 11.  3  5  7  2n  1 
   n  1
2
 1  1   1  4   1  9  ........  1  2
 2.4 2k+1
+3 3k+1
= 11t for some t  N      n 
A: Let the given statement be S(n).
 2.42k+1 = 11t - 33k+1 ............(1)
 3  5  7  2n  1
2  
Consider 2.42(k+1)+1 + 33(k+1)+1  n  1
2
S(n)= 1 1 1 ........1
= 2.42k+1 . 42 + 33k+1 . 33  1  4  9  n 
Let n = 1
= 16[11t - 33k+1] + 27 . 33k+1
 3
L.H.S =  1   1 3  4
= 11(16t) + 33k+1 (27 - 16)
 1 
= 11[16t + 33k+1] R.H.S = (1+1)2 = 22 = 4
Thus the statement P(n) is true for n = k+1. L.H.S. = R.H.S.
 S(n) is true for n = 1
Hence, by the principle of mathematical induction
Assume that the given statement is true for n = k
2.42n+1 + 33n+1 is divisible by 11 for all n  N.
i.e., S(k) =

11. Show that 3.52n+1 + 23n+1 is divisible by 17 for

 3  5  7  2n  1 
   n  1
2
all nN.  1  1   1  4   1  9  ........  1  2
     n 
A: Let P(n) be the statement: Now we have to prove that the given statement is
3.52n+1 + 23n+1 is divisible by 17. true of n = k + 1.
If n=1, 3.52n+1 + 23n+1 = 3.53 + 24 L.H.S. : Put n = k + 1 in S(n)
= 3(125) + 16 S(k+1)
= 375 + 16  3  5  7   2k  1  1
= 1 1 1  ....... 1 
= 391  1  4  9  
  k  1 2


= 17(23)
 3  5  7   2k  1  2k  3 
Thus the statement is TRUE for n =1. 1 1 1
=  1  4  9  ....... 1 2  1
  k  1 
     k  2

Assume that the statement is true for n = k.
 3.52k+1 + 23k+1 is divisible by 17.  2k  3 

= S(k)  1  
 3.52k+1 + 23k|1 = 17t for some t  N.
  
2
 k  1 
 3.52k+1 = 17t - 23k+1 .............(1)
 
2   k  1  2k  3 
2

  
k  1
  from S(k)
Consider 3.52(k+1)+1 + 23(k+1)+1
  k  12 
= 3.52k+1 . 52 + 23k+1 . 23 = k2 + 4k + 4
= 25(17t - 23k+1 ) + 8.23k+1 = (k + 2)2
k  1  1
2
= 17(25t) - 23k+1 (25 - 8) =
= 17 (25t - 23k+1) = R.H.S.
 The statement is true for n = k+1. L.H.S. = R.H.S.
Hence, by the principle of mathematical induction  S(n) is true for n = k + 1.
3.52n+1 + 23n+1 is divisible by 17. Hence by the principle of mathematical induction
given statement is true for all n  N.

Mathematical Induction 5
MATHEMATICS- IA WWW.AIMSTUTORIAL.IN
13.Use mathematical induction to prove that (k+1)(2k2 +7k+6)
(1 + x)n > 1 + nx for n  2, x > -1, x  0. = 2k2 + 7k + 6
6
(k+1)(k+2)(2k+3)
A: Let P(n) be the statement that (1 + x)n > 1 + nx, n  2. = = 2k2 + 4k + 3k + 6
6
If n = 2, (1 + x)2 = 1 + 2x + x2. (k+1)[(k+1+1][2(k+1)+1]
= = 2k(k+2)+3(k+2)
> 1 + 2x  x  0, x > -1. 6
Thus P(1) is true. = (k+2) (2k+3)
Assume that P(k) is true, k  2  P(k+1) is TRUE.
Hence, by the principle of mathematical induction
 (1 + x)k > 1 + kx for k  2 .
P(n) is true for all n N.
Now (1 + x)k + 1 = (1 + x)k (1 + x)
> (1+kx) (1 + x) 2. Show that xn - yn is divisible by x-y for all
> 1 + (k + 1)x + kx2
nN by using mathematical induction.
> 1+(k+1)x
Thus the statemet is true for n = k + 1. A: Let P(n) be the statement:
Hence by the principle of mathematical induction, xn - yn is divisible by x-y for nN.
P(n) is true for all n  2, n  N. If n =1, xn - yn = x1 - y1
= 1(x-y)
LEVEL - II (LAQ)  The statement is TRUE for n=1.
Assume that the statement is true for n = k.
1. Using induction, prove that  xk - yk is divisible by x-y
1 + 2 + 3 + ............. + n = n(n+1) (2n+1) n  N .
2 2 2 2
 xk - yk = (x-y) f(x, y) where f is some function in
6
A: Let P(n) be the given statement: x, y.
n(n+1)(2n+1) Consider xk+1 - yk+1 = xk+1 - xk . y + xk . y - yk+1
12 + 22 + 32 + ..........+n2 = = xk (x - y) + y (xk - yk)
6
If n = 1, LHS = 1 2
= xk (x - y) + y. (x-y) f(x, y)
=1 from (1)
(1)(1+1)(2+1) = (x-y) [xk + y. f(x, y)]
RHS =
6
The statement is true for n = k+1.
= 6
6
Hence, by the principle of mathematical induction
= 1. xn - yn is divisible by x - y for all n  N.
 LHS = RHS.
Thus P(1) is TRUE. 3. Using mathematical induction prove that
Assume that P(k) is true (2n + 7) < (n + 3)2 if  n  N.
A: Let the given statement be S(n).
k(k+1)(2k+1)
 12 + 22 + 32 + ...............+k2 = i.e., P(n) : (2n + 7) < (n + 3)2  n  N.
6
Adding (k+1)2 on both sides, we get Let n = 1 then (2 + 7) < (1 + 3)2.
12 + 22 + 32 + .............+k 2 + (k+1)2  9 < 16
k(k+1)(2k+1) Which is true
= + (k+1)2
6  P(n) is true for n = 1
k(k+1)(2k+1)+6(k+1)2 Assume that the given statement is true for n = k
= i.e, (2k + 7) < (k + 3)2.
6
Now we have to prove that the given statement is
(k+1)[k(2k+1)+6(k+1)]
= true for n = k + 1.
6
i.e., To prove that 2(k + 1) + 7 < ((k+1)+3)2

Mathematical Induction 6