n n

(1) r . Hence proved

r 1 Cr 1
=
r 1 r r 1

Example : 32

C0 C1 C2 C3 Cn 4 n n!
Show that + + ......... + (1)n =
1 5 9 13 4n  1 1.5.9......( 4n  1)
Solution
On observing the LHS of the relationship to be proved, we can conclude that the expansion of (1 x4)n
must be used to prove LHS equals RHS Hence,
(1 x4)n = C0 C1x4 + C2x8 C3x12 + ......... + (1) nCn x4n
Integrating both sides between limits 0 and 1, we get :
1

(1  x
4 n
) C0 C1 C9 C13 Cn
= + + ......... + (1)n .........(i)
0 1 5 9 13 4n  1

(1  x
4 n
Let n = ) dx ......... (ii)
0

apply by-parts taking (1 x4)n as the part and dx as the part ,

1

n (1  x
4 n 1
n = (1 x ) x] 0 4 n 1 ) (4x3) x dx
0

1 1

x [1  (1  x )](1  x 4 )n1 dx
4 n 1 4
n = 4n
4
(1  x ) dx = 4n
0 0

1 1

(1  x 4 )n1 dx 4n (1  x
4 n
n = 4n ) dx
0 0

n = 4n n1 4n n
4n
n =
4n  1 n1
Replace n by 1, 2, 3, 4, ........, n1 in the above identity and multiply all the obtained relations,
4n 4(n  1) 4(n  2) 4
n = . . .......... ..........(iii)
4n  1 4n  3 4n  7 5 0
Finding 0
0 can be obtained by substituting n = 0 in (ii) i.e.
1 1

0 =
0
(1  x 4 )0 dx = dx
0
1

Substitute the value of 0 in (iii) to get :

4n 4(n  1) 4(n  2) 4
n = . . ..........
4n  1 4n  3 4n  7 5

4 n n!
n =
1.5.9.13.......( 4n  1)
Using (i)

Page # 14.
 C0 C1 C2 C3 Cn 4 n n!
+ + ........ + (1)n =
1 5 9 13 4n  1 1.5.9.....( 4n  1)
Hence proved

Example : 33
Show that xn yn is divisible by x y if n is natural number.
Solution
Let P(n) = xn yn is divisible by x y
We consider P(1)
P(1) : x1 y1 is divisible by x y
P(1) is true
Now let us assume p(k) to be true
i.e. we are given P(k) : xk yk is divisible by x y
Let x yk = (x y) m, m
k

Consider P(k + 1) :
P(k + 1) : xk+1 yk+1 is divisible by x y;
Now xk+1 yk+1 = xk+1 xky + xky yk+1
= xk (x y) + y (xk yk)
= xk (x y) + y (x y)m
= (x y) (xk + my)
Hence P(k + 1) is true whenever P(k) is true.
Hence according to the principle of Mathematical Induction, P(n) is true for all natural numbers.

Example : 34
Show that 52n+2 24n 25 is divisible by 576.
Solution
Let P(n) : 52n+2 24 25 is divisible by 576
P(1) : 52(1)+2 24 (1) 25 is divisible by 576
P(1) : 576 is divisible by 576
P(1) is true
P(k) : 52k+2 24k 25 = 576m, m N
P(k + 1) : 52k+4 24 (k + 1) 25 is divisible by 576
Consider 52k+4 24 (k + 1) 25
= 52k+4 24 (k + 1) 25
= 52k+2 . 52 24k 49
= 25 (24k + 25 + 576m) 24k 49 [using P(k)]
= (576) 25m 576k + 576
= 576 (25m k + 1)
52k+4 24 (k + 1) 25 is divisible by 576
Hence P(k + 1) is true whenever p(k) is true
Hence according to the principle of Mathematical Induction P(n) is true for all natural numbers.

Example : 35
Show that 2n > n for all natural numbers
Solution
Let P(n) : 2n > n
P(1) : 21 > 1
P(1) is true
P(k) : 2k > k
Assume that p(k) is true
P(k + 1) : 2k+1 > k + 1
consider P(k) : 2k > k
2k+1 > 2k

Page # 15.
 2k+1 > k + k
But we have k 1
Adding 2k+1 + k > k + k + 1
2k+1 > k + 1
Hence P(k + 1) is true whenever P(k) is true
Hence according to the principle of Mathematical Induction, P(n) is true for all natural numbers.

Example : 36

1 1 1 1 n
Prove by the method of Induction that : + + + ...... + =
3 .7 7.11 11.15 ( 4n  1)(4n  3) 3( 4n  3)
Solution

1 1 1 1 n
Let P(n) : + + + ...... + =
3 .7 7.11 11.15 ( 4n  1)(4n  3) 3( 4n  3)

1 1
P(1) : =
3 .7 3( 4  3)

1 1
P(1) : =
21 21
P(1) is true

1 1 1 k
P(k) + + .......... + =
3 .7 7.11 ( 4k  1)( 4k  3 ) 3( 4k  3)
Assume that P(k) is true

1 1 1 1 k 1
P(k + 1) : + + ....... + + =
3 .7 7.11 ( 4k  1)( 4k  3 ) ( 4k  3 )( 4k  7 ) 3( 4k  7)

1 1 1
LHS =   ......  k terms +
3 . 7 7 . 11 ( 4k  3)( 4k  7)

k 1
= + [using P(k)]
3(4k  3) ( 4k  3)( 4k  7)

k( 4k  7)  3
=
3( 4k  3)( 4k  7)

( 4k  3)(k  1) (k  1)
= = = RHS of P(k + 1)
3( 4k  3)( 4k  7) 3( 4k  7)
Hence P(k + 1) is true whenever P(k) is true
Hence according to the principle of Mathematical Induction, P(n) is true for all natural numbers.

Example : 37
Using Mathematical Induction, show that n(n2 1) is divisible by 24 if n is an odd positive integer.
Solution
To prove a statement for odd numbers only, it is required to show that
(a) P(1) is true
(b) P(k + 2) is true whenever p(k) is true
P(1) : 1 (12 1) is divisible by 24
P(1) is true
P(k) : k(k2 1) is divisible by 24 if k is odd
Assume that P(k) is true
Let k (k2 1) = 24m where m N
P(k + 2) : (k + 2) [(k + 2)2 1] is divisible by 24, if k is odd
Consider (k + 2) [(k + 2)2 1]
= (k + 2) (k2 + 4k + 3)

Page # 16.
 = k3 + 6k2 + 11k + 6
= (24m + k) + 6k2 + 11k + 6
= (24m + 6k2 + 12k + 6 [using P(k)]
= 24m + 6 (k + 1)2
= 24m + 6 (2p)2 [ k is odd]
= 24m + 24p2
= 24 (m + p2)
Hence P(k + 2) is true whenever P(k) is true
Hence according to the principle of Mathematical Induction, P(n) is true for all natural numbers.

Example : 38

sin 2n x
Prove that cos x cos 2x cos 4x ....... cos2n1 x =
2n sin x
Solution
sin 2 x
P(1) : cos x =
2 sin x
P(1) : cos x = cos x (using sin 2x = 2 sin x cos x)
P(1) is true

sin 2k x
P(k) : cos x cos 2x cos 4x ....... cos 2k1 x =
2k sin x
Let P(k) be true. Consider P(k + 1)

sin 2k 1 x
P(k = 1) : cos x cos 2x cos 4x .... cos 2k1 x cos 2kx =
2k 1 sin x

sin 2k x 2 sin 2k x cos 2k x sin 2k 1 x

LHS = k cos 2kx = = = RHS
2 sin x 2k 1 sin x 2k 1 sin x
Hence P(k + 1) is true whenever P(k) is true
by mathematical induction P(n) is true n N

Example : 39
By the method of induction, show that (1 + x)n 1 + nx for n N, x > 1, x 0
Solution
Let P(n) : (1 + x)n 1 + nx
P(1) : (1 + x)1 1 + x which is true
k
Let P(k) be true (1 + x) 1 + kx .......(i)
Consider P(k + 1) : (1 + x)k+1 1 + (k + 1)x
From (i) : (1 + x)k 1 + kx
(1 + x)k+1 (1 + kx) (1 + x) (as (1 + x) > 0)
(1 + x)k+1 1 + (k + 1)x + kx2
as kx2 is positive, it can be removed form the smaller side.
(1 + x)k+1 1 + (k + 1)x
P(k + 1) is true
Hence P(1) is true and P(k + 1) is true whenever P(k) is true
By induction, P(n) is true for all n N

Example : 40
Prove that x(xn1 nan1) + an (n 1) is divisible by (x a)2 for n > 1 and n N
Solution
Let P(n) : x(xn1 nan1) + an (n 1) is divisible by (x a)2
As n > 1, we will start from P(2)
For n = 2, the expression becomes
= x(x 2a) + a2 (2 1) = (x a)2 which is divisible by (x a)2
P(2) is true

Page # 17.
 Let P(k) be true
x (xk1 kak1) + ak (k 1) is divisible by (x a)2
For n = k + 1, the expression becomes = x[xk (k + 1) ak] + ak+1k = xk+1 kxak xak + kak+1
= [xk + 1 kx2ak1 + xak (k 1)] + kx2 ak1 xak(k 1) kxak xak + kak+1
= x[x(xk1 kak1) + ak (k 1)] + kak1 (x2 2ax + a2)
= divisible by (x a)2 from P(k) + kak1 (x a)2
Hence the complete expression is divisible by (x a)2
P(K + 1) is true
Hence P(2) is true and P(k + 1) is true whenever P(k) is true
By induction, P(n) is true for all n > 1, n N
Alternate Method : Let f(x) = x(xn1 nan1) + an (n 1)
It can be show that f(a) = f(a) = 0
f(x) is divisible by (x a)2

Example : 41
1 1 1 13
For any natural number n > 1, prove that + + ......... + >
n 1 n2 2n 24
Solution
1 1 1 13
Let P(n) : + + ......... + >
n 1 n2 2n 24

1 1 13 7 13
for n = 2, + > > which is true
2 1 22 24 12 24
P(2) is true
Let P(k) be true
1 1 1 13
+ + .......... + >
k 1 k2 2k 24
Consider P(k + 1) :

1 1 1 13
+ + ......... + >
k2 k3 (k  1)  (k  1) 24
Using P(k) we have :
1 1 1 13
+ + ......... + >
k 1 k2 2k 24

1 1 1
adding + on both sides, we get
2k  1 2k  2 k 1

1 1 1 1 13 1 1 1
+ + ....... + + > + +
k2 k3 2k  1 2k  2 24 2k  1 2k  2 k 1

1 1 1 13 (2k  2)  (2k  1)  2(2k  1)

+ ........ + = > +
k2 2k  1 2k  2 24 2(k  1)(2k  1)

1 1 1 13 1
+ .......... + + > +
k2 2k  1 2k  2 24 2(k  1)(2k  1)

1
as is positive, it can be removed the smaller side
2(k  1)(2k  1)

1 1 1 13
+ ........ + + >
k2 2k  1 2k  2 24
P(k + 1) is true
Hence P(2) is true and P(k + 1) is true whenever P(k) is true
By induction, P(n) is true for all n > 1, n N

Page # 18.
Example : 42
n
n  1
If n > 1, prove that n! <
2
Solution
n
n  1
Let P(n) : n! <
2

2
3
for n = 2, 2! < which is true
2
P(2) is true
Let P(k) be true
k
k  1
k! <
2

k 1
k  2
P(k + 1) : (k + 1) ! < .......(i)
2
using P(k), we have
k
k  1
k! <
2

(k  1)k 1
(k + 1)! < .......(ii)
2k
Let us try to compare the RHS of (i) and (ii).
k 1
(k  1)k 1 k  2
Let us assume that < .......(iii)
2k 2

k 1 k 1
k 2 1
>2 1  >2
k 1 k  1
Using Binomial Expansion :
2
1 1
1 + (k + 1) + k+1C2 + .........> 2
k 1 k  1

2
1
1 + 1 + k+1C2 + .........> 2 which is true
k  1
Hence (iii) is true
From (ii) and (iii), we have
k 1
(k  1)k 1 k  2
(k + 1)! < <
2k 2

k 1
k  2
(k + 1)! <
2
P(K + 1) is true
Hence P(2) is true and P(k + 1) is true whenever P(k) is true
By induction, P(n) is true for all n > 1, n N

Example : 43
Prove that An = cos n if it is given that A1 = cos , A2 = cos 2 and for every natural number m > 2, the

Page # 19.
 relation Am = 2 Am1 cos Am 2 .
Solution
The principle of induction can be extended to the following form :
P(n) is true for all n N, if
(i) P(1) is true and P(2) is true and
(ii) P(k + 2) is true whenever P(k) and P(k + 1) are true
Let P(n) : An = cos n
Hence A1 = cos , A2 = cos 2 P(1) and P(2) are true
Now let us assume that P(k) and P(k + 1) are true
Ak = cos k and Ak+1 = cos (k + 1)
We will now try to show that P(k + 2) is true
Using Am = 2 Am1 cos Am2 , (for m > 2)
We have Ak+2 = 2Ak+1 cos Ak (for k > 0)
Ak+2 = 2 cos (k + 1) cos = cos k
= cos (k + 2) + cos k cos k
= cos (k + 2)
P(k + 2) is true
Hence P(1), P(2) are true and P(k + 2) is true whenever P(k), P(k + 1 are true
By induction, P(n) is true for all n N

Example : 44

n

n
1 1  5  1  5

5 2 2
Let u1 = 1, u2 = 1 and un+2 = un + un+1 for n 1. Use induction to show that un =

for all n 1.
Solution

n

n
1 1  5  1  5

5 2 2
Let P(n) : un =

1

1
1 1  5  1  5
=1
5 2 2
P(1) : u1 = which is true

2

2
1 1  5  1  5
=1
5 2 2
P(2) : u2 = which is true

Hence P(1), P(2) are true

Let P(k), P(k + 1) be true

k

k
1 1  5  1  5

5 2 2
We have : uk =

k 1

k 1
1 1  5  1  5
2
5 2
And uk1 =

Let us try to prove that P(k + 2) is true

From the given relation : uk+2 = uk + uk+1

k

k
k 1

k 1
1 1  5  1  5 1 1  5  1  5
2 2
5 2 2
uk+2 =
5

Page # 20.
 k
k

1 1  5 1  1  5 1 1  5 1  1  5
2 5 2 2
5 2
uk+2 =

k

2 k

2
1 1  5 1  5 1  5 1  5
2 2
5 2 2
uk+2 =

k 2
1 5
k2
1 1  5 
2
5 2
uk+2 =

P(k + 2) is true
Hence P(1), P(2) are true and P(k + 2) is true whenever P(k), P(k + 1) are true
By induction, P(n) is true for all n N

Example : 45
n

Use mathematical induction to prove that k

k 0
2 n
Ck = n(n + 1) 2n2 for n 1

Solution
n

Let P(n) : k
k 0
2 n
Ck = n (n + 1) 2n2

for n = 1 :
k
k 0
2 1
Ck = 1 (1 + 1) 212

i.e. 1 = 1 which is true P(1) is true

Let P(m) be true
m

k
k 0
2 m
Ck = m (m + 1) 2m2

m1

consider P(m + 1) : k
k 0
2 m 1
Ck = (m + 1) (m + 2) 2m1

m1 m 1 m m 1

LHS of P(m + 1) : = k
k 0
2 m 1
Ck = k
k 0
2
(mCk + mCk1) = k
k 0
2
m
Ck + k 2
m
Ck1
k 1

= m(m + 1) 2m2 + (t  1)
t 0
2 m
Ct substituting k = t + 1

m 1 m m

= m (m + 1) 2m2 + t
t 0
2
m
Ct + 2 t
t 0
m
Ct +
t 0
m
Ct

using P(k) and C1 + 2C2 + 3C3 + ............nCn = n2n1

LHS = m (m + 1) 2m2 + m (m + 1) 2m2 + 2 (m2m1) + 2m = 2m1 [m(m + 1) + 2m + 2]
= 2m1 (m + 1) (m + 2) = RHS
P(m + 1) is true
Hence P(1) is true and P(m + 1) is true whenever P(m) is true
By induction, P(n) is true for all n N

Example : 46

Page # 21.
 n5 n3 7n
Using mathematical induction, prove + + is an integer for all n N
5 3 15
Solution

n5 n3 7n
Let P(n) : + + is an integer
5 3 15

1 1 7
P(1) : + = = 1 is an integer P(1) is true
5 3 15

k5 k3 7k
Let us assume that P(k) is true i.e. P(k) : + + is an integer ..........(i)
5 3 15
Consider LHS of P(k + 1)

(k  1)5 (k  1)3 7(k  1)

LHS of P(k + 1) = + +
5 3 15

k 5  5k 4  10k 3  10k 2  5k  1 k 3  3k 2  3k  1 7(k  1)

= + +
5 3 15

k5 k3 7k 1 1 7
= + + + k4 + 2k3 + 3k2 + 2k + = +
5 3 15 5 3 15
= P(k) + k4 + 2k3 + 3k2 + 2k + 1 [using (i)]
As P(k) and k both are positive integers, we can conclude that P(k + 1) is also an integer
P(k + 1) is true
Hence by principle of mathematical induction, P(n) si true for all n N

Example : 47
Using mathematical induction, prove that for any non-negative integers n, m, r and k,
k
(r  k  1)! n  k
(n  m )
m 0
(r  m)!
m!
=
k!
r  1 r  2

Solution
In this problem, we will apply mathematical induction on k.
k
(r  k  1)! n  k
Let P(k) : (n  m )
m 0
(r  m)!
m!
=
k!
r  1 r  2

Consider P(0)
0
(r  m)!
LHS of P(0) = (n  m )
m 0
m! =n
r!
0!
= nr!

(r  1)! n 0 n(r  1)!

RHS of P(0) = r  1  r  2 = = nr!
0! r 1
P(0) is true
Let us assume that P(k) is true for k = p
p
(r  p  1)! n p
(n  m)
m 0
(r  m)!
m!
=
p! 
r  1 r  2
..........(i)

Consider LHS of P(p + 1)

p 1 p
(r  p  1)!
LHS of P(p + 1) = (n  m) (r  m! ) =
m! m
(n  m)
0
(r  m)!
m!
+ (n p 1)
(p  1)!
m 0

using (i), we get :

Page # 22.
 (r  p  1)! n p (r  p  1)!
LHS of P(p + 1) =  + (n p 1)
p! r  1 r  2 (p  1)!

(r  p  1)! n(p  1) (p  1)
  n  (p  1)
(p  1)! r  1
=
r2

(r  p  1)! n(p  1) (p  1)
=  n   (p  1)
(p  1)! r  1 r2

(r  p  1)! (p  r  2)n (p  1)(p  r  2)


(p  1)!
=
r 1 r2

(r  p  2)! n (p  1)
=
(p  1)! r  1  r  2 = RHS of P(p + 1)

P(p + 1) is true
Hence, by principle of mathematical induction, P(n) is true for all n = 0, 1, 2, 3, ........

Example : 48
If x is not an integral multiple of 2 , use mathematical induction to prove that :
n 1 nx x
cos x + cos 2x + ......... + cos nx = cos x sin cosec
2 2 2
Solution
n 1 nx x
Let P(n) : cos x + cos 2x + ......... + cos nx = cos x sin cosec
2 2 2
LHS of P(1) = cos x
1 1 1.x x
RHS of P(1) = cos x sin cosec = cos x
2 2 2
Let us assume that P(k) is true
k 1 kx x
i.e. P(k) : cos x + cos 2x + ........... + cos kx = cos x sin cosec
2 2 2
Consider LHS of P(k + 1)
LHS of P(k + 1) = cos x + cos 2x + ............ + cos kx + cos (k + 1) x
Using P(k), we get :
k 1 kx x
LHS of P(k + 1) = cos x sin cosec + cos (k + 1) x
2 2 2

k 1 kx x k 1 kx x
cos x sin  cos(k  1)x sin 2 cos x sin  2 cos(k  1)x sin
2 2 2 2 2 2
= =
x x
sin 2 sin
2 2

2k  1 kx 2k  3 2k  1 2k  3 kx
sin x  sin  sin x  sin x sin x  sin
2 2 2 2 2 2
= = x
x 2 sin
2 sin
2 2

k  2 k  1
2 cos x sin x
2 2 k  2 k  1 x
= x = cos x sin x cosec = RHS of P(k + 1)
2 sin 2 2 2
2
P(k + 1) is true
Hence by principle of mathematical induction, P(n) is true for all n N
Page # 23.
Example : 49
n
Using mathematical induction, prove that for every integer n 1, 3 2  1 is divisible by 2n+2 but not divisible
by 2n+3 .
Solution
n
Let P(n) : 3 2  1 is divisible by 2n+2 , but not divisible by 2n+3.
P(1) : 8 is divisible by 23 , but not divisible by 24 .
P(1) : 8 is divisible by 8, but not divisible by 16
P(1) is true
Let P(k) is true
k
i.e. 3 2  1 is divisible by 2k+2 , but not divisible by 2k+3
k
3 2  1 = m 2k+2 , where m is odd number so that P(k) is not divisible by 2k+3 ..........(i)
Consider P(k + 1)
2
 1 = 3 1
k 1 2k
LHS of P (k + 1) = 3 2

Using (i), we get :
LHS of P(k + 1) = (m2k+2 + 1)2 1
= m2 22k+4 + 2m.2k+2
= 2k+3 (m2 2k+1 + m)
= p 2k+3 where p is an odd number because m2 2k+1 is even and m is odd.
P(k + 1) is divisible by 2 , but not divisible by 2k+4 as p is odd
k+3

P(k + 1) is true
Hence, by mathematical induction, P(n) is true for all n N

Example : 50
Using mathematical induction, prove that : mC0 nCk + mC1 nCk1 + mC2 nCk2 + ...... + mCk nC0 = m+nCk for p < q,
where m, n and k are possible integers and pCq = 0 for p < q.
Solution
First apply mathematical induction on n
Let P(n) : mC0 nCk + mC1 nCk1 + mC2 nCk2 + ........ + mCk nC0 = m+nCk
Consider P(1)
LHS of P(1) = mCk1 1C1 + mCk 1C0 = m+1Ck = RHS of P(1)
P(1) is true
Assume that P(n) is true for n = s
i.e. P(s) : mC0 sCk + mC1 sCk1 + mC2 sCk2 + ....... + mCk sC0 = m+sCk
Consider LHS of P(s + 1)
LHS of P(s + 1) = mC0 s+1Ck + mC1 s+1Ck1 + mC2 s+1Ck2 + ....... + mCk s+1C0
LHS of P(s + 1) = mC0 (sCk + sCk1) + mC1 (sCk1 + sCk2) + ........ + mCk s+1C0
= [mC0 sCk + mC1 sCk1 + ....... + mCk sC0] [mC0 sCk1 + mC1 sCk2 + ........ + mCk1 sC0]
= P(s) + P(s)]where k is replaced by k 1 in the P(s)
LHS of P(s + 1) = m+sCk + m+sCk1 = m+s+1Ck = RHS of P(s + 1)
P(n + 1) is true for all n N
Similarly we can show that the given statement is true for all m N.

Example : 51

Let p 3 be an integer and , be the roots of x2 (p + 1) x + 1 = 0. Using mathematical induction, show

that n + n
(i) is an integer and
(ii) is not divisible by p
Solution
It is given that and are roots of x2 (p + 1) x + 1 = 0
+ = p + 1 and = 1 .............(i)
(i) Let P(n) : n + n is an integer
Page # 24.
 P(1) : + = p + 1 is an integer
As it is given that p is an integer, P(1) is true.
P(2) : 2 + 2 = ( + )2 2 = (p + 1)2 2 is an integer.
As p is an integer, (p + 1)2 2 is also an integer P(2) is true
Assume that both P(k) and P(k 1) are true
i.e. k + k and k1 + k1 both are integers
Consider LHS of P(k + 1) i.e.
LHS of P(k + 1) = k+1 + k1 = ( ) (k + bk) (k1 + bk1)
LHS of P(k + 1) = p P(k) P(k 1) [using (i)]
LHS of P(k + 1) = integer because p, P(k 1) and P(k) all are integer
P(k + 1) is true. Hence P(n) is true for n N.
(ii) Let P(n) = n + n is not divisible by p
P(1) : + = p + 1 = a number which is not divisible by p P(1) is true
P(2) : 2 + 2 = ( + )2 2
= (p + 1)2 2 = p (p + 2) 1
= a number which is divisible by p a number which is not divisible by p
= a number which is not divisible by p P(2) is true
P(3) : 3 + b3 = ( + ) (2 + 2 ) = (p + 1) [(p + 1)2 3] = p[(p + 1)2 3] + p(p + 2) 2
= p [(p + 1)2 + p 1] 2
= a number which is divisible by p a number which is not divisible by p
= a number which is not divisible p P(3) is true
Assume that P(k), P(k 1) and P(k 2) all are true
i.e. k + k , k1 and k+2 + k2 all are non-divisible by p.
Consider LHS of P(k + 1) i.e.
LHS of P(k + 1) = k+1 + k+1 = ( + ) (k + bk) (k1 + bk1)
= p(k bk) + (k + bk) (k1 + bk1)
= p P(k) + [(p + 1) (k1 bk1) (k+2 + bk2)] (k1 + bk1)
= p P(k) + p P(k 1) P(k 2)
= p[P(k) + P(k 1)] P(k 2)
= a number which is divisible by p a number which is not divisible by p
= a number which is not divisible by p
P(k + 1) is true
Hence, by principle of mathematical induction P(n) is true for all n N

Example : 52

dn log x ( 1)n log x  1  1  ......  1

Use mathematical induction to prove that = for all n N and
x x n 1 n
n 2
dx
x > 0.
Solution

dn log x ( 1)n log x  1  1  ......  1

Let P(n) : =
dx n x x n 1 2 n

1
d log x . x  log x 1 log x
LHS of P(1) : = x =
dx x x2 x2

(1)! 1 log x
RHS of P(1) = 2 (log x 1) =
x x2
P(1) is true
Let us assume that P(k) is true i.e.

dk log x ( 1)k k! log x  1  1  ......  1

P(k) : = ..........(i)
dx k x x k 1 2 k
Consider LHS of P(k + 1) i.e.

Page # 25.