Example : 1

9
⎛ 4x 5 ⎞
(i) Find the 7th term in the expansion of ⎜ − ⎟
⎝ 5 2x ⎠

11
⎛ 2 1 ⎞
(ii) Find the coefficient of x in ⎜ ax + 7⎟
⎝ bx ⎠
Solution
9
⎛ 4x 5 ⎞
(i) In the expansion of ⎜ − ⎟
⎝ 5 2x ⎠

9 −r r
⎛ 4x ⎞ ⎛ 5 ⎞
The general terms is Tr+1 = Cr ⎜ ⎟ 9 ⎜− ⎟
⎝ 5 ⎠ ⎝ 2x ⎠
For 7th term (T7), Put r = 6
9−6 6
⎛ 4x ⎞ ⎛ 5 ⎞
⇒ T7 = T6+1 = C6 ⎜ 9 ⎟ ⎜− ⎟
⎝ 5 ⎠ ⎝ 2x ⎠

3 6
9×8×7 ⎛ 4⎞ 3 ⎛ 5⎞ 1
⇒ T7 = ⎜ ⎟ x ⎜− ⎟
3! ⎝5⎠ ⎝ 2⎠ x6

9×8×7 3 1
⇒ T7 = 5 3
3! x

10500
⇒ T7 =
x3
11
⎛ 2 1 ⎞
(ii) In ⎜ ax + ⎟ general term is Tr+1 = 11Cr a11–r b–r x22–3r
⎝ bx ⎠
for term involving x7 , 22 – 3r = 7
⇒ r=5
Hence T5+1 or the 6th term will contain x7.
5
⎛ 1 ⎞ 11× 10 × 9 × 8 × 7 a 6 7 462a 6 7
11
T6 = C5 (ax ) 2 11–5 ⎜ ⎟ = x = x
⎝ bx ⎠ 5! b5 b5

462a 6
Hence the coefficient of x7 is
b5

Example : 2
9
⎛ 3x 2 1 ⎞⎟
Find the term independent of x in ⎜⎜ −
⎝ 2 3x ⎟⎠

Solution
9 −r 9 −r
⎛ 3x 2 ⎞ ⎛ 1 ⎞
r
⎛ 3x 2 ⎞ ⎛ 1 ⎞ 18–3r
r

Tr+1 = Cr ⎜⎜
9 ⎟
⎟ ⎜− ⎟ = 9Cr ⎜
⎜ 2 ⎟
⎟ ⎜− ⎟ x
⎝ 2 ⎠ ⎝ 3x ⎠ ⎝ ⎠ ⎝ 3x ⎠
for term independent of x, 18 – 3r = 0
⇒ r=6
Hence T6+1 or 7th term is independent of x.
9 −6
⎛ 3x 2 ⎞ ⎛ 1 ⎞
6
9×8×7 ⎛3⎞
3
⎛ 1⎞
6
7
T7 = C6 ⎜⎜
9 ⎟
⎟ ⎜− ⎟ = ⎜ ⎟ ⎜− ⎟ =
⎝ 2 ⎠ ⎝ 3 x ⎠ 3! ⎝2⎠ ⎝ 3 ⎠ 18
Page # 1.
Example : 3
Find the coefficient of x11 in the expansion of (2x2 + x – 3)6.
Solution
(2x2 + x – 3)6 = (x – 1)6 (2x + 3)6
term containing x11 in (2x2 + x – 3)6
(x – 1)6 = 6C0 x6 – 6C1 x5 + 6C2 x4 – 6C3 x3 + ............
(2x + 3)6 = 6C0 (2x)6 + 6C1 (2x)5 3 + 6C2 (2x)4 32 + .........
term containing x11 in the product (x – 1)6 (2x + 3)6 = [C0 x6] [6C1 (2x)5 3] – [6C1 x5] [6C0 (2x)6 ]
= 32 (18 x11) – 6 (64) x11 = 192 x11
⇒ the coefficient of x11 is 192

Example : 4
Find the relation between r and n so that coefficient of 3rth and (r + 2)th terms of (1 + x)2n are equal.
Solution
In (1 + x)n , Tr+1 = 2nCr xr
2n 3r–1
T3r = C3r–1 x
Tr+2 = 2nCr+1 xr+1
If the coefficient are equal then 2nC3r–1 = 2nCr+1
There are two possibilities
Case – 1
3r – 1 = r + 1
⇒ r=1
⇒ T3r = T3 and Tr+2 = T3
⇒ T3r and Tr+2 are same terms
Case – 2
2n
C3r–1 = 2nCr+1
⇒ 2n
C3r–1 = 2nC2n–(r+1)
⇒ 3r – 1 = 2n – (r + 1)
⇒ r = n/2

Example : 5
Find the coefficient of x3 in the expansion (1 + x + x2)n .
Solution
(1 + x + x2)n = [1 + x (1 + x)]n = nC0 + nC1 x (1 + x) + nC2 x2 (1 + x)2 + ...........
Coefficient of x3 = nC2 [coeff of x in (1 + x)2] + nC3 [coeff of x0 in (1 + x)3]
2n(n − 1) n(n − 1)(n − 2) n(n − 1) n(n − 1)(n + 4 )
= nC2 (2) + nC3 (1) = + = [6 + n – 2] =
2 3! 6 6

Example : 6
If nCr is denoted as Cr, show that

C0C1.....Cn (n + 1)n
(a) (C0 + C1) (C1 + C2) (C2 + C3) .......... (Cn–1 + Cn) =
n!

C1 C2 C3 Cn n(n + 1)
(b) C0 + 2 C1 + 3 C2 + ....... + n Cn −1 = 2
Solution
(a) LHS = (C0 + C1) (C1 + C2) (C2 + C3) ........ (Cn–1 + Cn)

⎛ C1 ⎞ ⎛ C ⎞ ⎛ C ⎞
Multiply and Divide by C0 C1 C2 ..... Cn = C0 C1 C2 .......Cn ⎜⎜1 + C ⎟⎟ ⎜⎜1 + 2 ⎟⎟ ...... ⎜⎜1 + n ⎟⎟
⎝ 0 ⎠ ⎝ C1 ⎠ ⎝ Cn −1 ⎠

Cr n−r +1 ⎛ n − 1 + 1⎞ ⎛ n − 2 + 1⎞ ⎛ n − n + 1⎞
using C = = C0 C1 C2 C3 ...... Cn ⎜1 + ⎟ × ⎜1 + ⎟ + ........ + ⎜1 + ⎟
r −1 r ⎝ 1 ⎠ ⎝ 2 ⎠ ⎝ n ⎠

⎛ n + 1⎞ ⎛ n + 1⎞ ⎛ n + 1⎞
⎟ = C C C C ...... C (n + 1) = RHS
n
= C0 C1 C2 ...... Cn ⎜ ⎟ ⎜ ⎟ + ....... + ⎜
⎝ 1 ⎠ ⎝ 2 ⎠ ⎝ n ⎠ 0 1 2 3 n
n!
Page # 2.
 C1 C2 C3 Cn
(b) LHS = C + 2 C + 3 C + ......... + n C
0 1 2 n−1

Cr n − r + 1 ⎛ n − 1+ 1⎞ ⎛ n − 2 + 1⎞ (n − n + 1)
using C = = ⎜ ⎟ +2 ⎜ ⎟ + ....... + n
r −1 r ⎝ 1 ⎠ ⎝ 2 ⎠ n
= n + (n – 1) + (n – 2) + ......... + 1
n(n + 1)
= Sum of first n natural numbers = = RHS
2

Example : 7
Show that
(2n)!
(a) C02 + C12 + C 22 + C32 + ......... + Cn2 = n! n!

(2n)!
(b) C0 C1 + C1C2 + C2C3 + ......Cn–1 Cn = (n − 1)! (n + 1)!

Solution
Consider the identities (1 + x)n = C0 + C1 x + C2x2 + ........... + Cnxn (1 + x)n
= C0xn + C1 Xn–1 + C2 xn–2 + .......+ Cn
multiplying these we get another identity
(1 + x)n (x + 1)n = (C0 + C1x = (C0 + C1x + C2x2 + ........ + Cnxn) = C0xn + C1xn–1 + C2xn–2 + ....... + Cn)
(a) Compare coefficients of xn on both sides
In LHS, coeff. of xn = coeff of xn in (1 + x)2n = 2nC0
In RHS, terms containing xn are C02 xn + C12 xn + C22 xn + ....... + Cn2 xn
⇒ Coeff. of xn on RHS = C02 + C12 + C22 + ....... + Cn2
equating the coefficients C02 + C12 + C22 + ......... Cn2 = 2nCn
(2n)!
C20 + C12 + C 22 + ......... + Cn2 = n! n!

(b) Compare the coefficients of xn–1 on both sides

In LHS, coeff. of xn–1 = 2nCn–1
In RHS, term containing xn–1 is C0C1 xn–1 + C1C2 xn–1 + ........
Hence coeff. of xn–1 in RHS = C0C1 + C1C2 + C2 C3 + .......
equation of the coefficients,
(2n)!
C0C1 + C1C2 + ....... = Cn–1 Cn = 2nCn–1 =
(n − 1)! (n + 1)!

Example : 8
Let Sn = 1 + q + q2 + q3 + ......... + qn
2 3 n
⎛ q + 1⎞ ⎛ q + 1⎞ ⎛ q + 1⎞
Sn = 1 + ⎜ ⎟ + ⎜ ⎟ + ....... + ⎜ ⎟
⎝ 2 ⎠ ⎝ 2 ⎠ ⎝ 2 ⎠
n+ 2 n +1
prove that n+1C1 + C 2 S1 + C 3 S 2 + ........ + n+1Cn+1 Sn = 2n Sn
Solution

1 − qn +1
Sn = sum of (n + 1) terms of a G.P. =
1− q

n+1
⎛ q + 1⎞
1− ⎜ ⎟
⎝ 2 ⎠ 2n+1 − (q + 1)n +1
Sn = =
⎛ q + 1⎞ (1 − q) 2n
1− ⎜ ⎟
⎝ 2 ⎠

Page # 3.
 ⎛ 1 − q2 ⎞ ⎛ 1 − q3 ⎞ ⎛ 1 − qn+1 ⎞
⎜ ⎟ ⎜ ⎟ ⎜ ⎟
Consider the LHS = n+1
C1 + n+1
C2 ⎜ 1 − q ⎟ + n+1C3 ⎜ 1− q ⎟ + ...... + Cn+1
n+1
⎜ 1− q ⎟
⎝ ⎠ ⎝ ⎠ ⎝ ⎠

1
= [n+1C1 (1 – q) + n+1C2 (1 – q2) + .......... + n+1Cn+1 (1 – qn+1)]
1− q

1
= [(n+1C1 + n+1C2 + ....... n+1Cn+1) – ( n+1C1q + n+1 C2 q2 + ....... + n+1 Cn−1qn+1 )]
1− q

1 2n+1 − (1 + q)n +1
= [(2n+1 – 1 – ((1 + q)n+1 – 1)] = = 2n Sn = RHS
1− q 1− q

Example : 9
Show that 32n+2 – 8n – 9 is divisible by 64 if n ∈ N.
Solution
32n+2 – 8n – 9 = (1 + 8)n+1 – 8n – 9 = [1 + (n + 1) 8 + (n+1C2 82 + ........] – 8n – 9
= n+1C2 82 + n+1C3 83 + n+1C4 84 + .........
= 64[n+1C2 + n+1C3 8 + n+1C482 + .......]
which is clearly divisible by 64

Example : 10
Find numerically greatest term in the expansion of (2 + 3x)9, when x = 3/2
Solution
9 9
⎛ 3x ⎞ ⎛ 9⎞
(2 + 3x) = 2 ⎜1 +
9 9 ⎟ = 29 ⎜1 + ⎟
⎝ 2 ⎠ ⎝ 4⎠

x(n + 1) (9 / 4)(9 + 1) 90 12
Let us calculate m = = = =6
x +1 (9 / 4 ) + 1 13 13
as m is not an integer, the greatest term in the expansion is T[m]+1 = T7
6
⎛9⎞ 7 × 313
⇒ the greatest term = 2 (T7) = 2 C6 ⎜ ⎟ =
0 9 9
⎝4⎠ 2

Example : 11
If a1, a2, a3 and a4 are the coefficients of any four consecutive terms in the expansion of (1 + x)n , prove that
a1 a3 2a 2
a1 + a 2 + a 3 + a 4 = a 2 + a 3
Solution
Let a1 = coefficient of Tr+1 = nCr ⇒ a2 = nCr+1 = nCr
⇒ a2 = nCr+1 , a3 = nCr+2 , a4 = nCr+3
n n n n
a1 Cr Cr r +1 a3 Cr + 2 Cr + 2 r +3
⇒ a1 + a 2 = = n+1 = and a + a = = n +1 =
n
C r + C r +1
n
Cr +1 n +1 3 4
n
Cr + 2 + Cr + 3
n
Cr + 3 n +1

a1 a3 r +1 r +3 2(r + 2)
LHS = a + a + a + a + = =
1 2 3 4 n +1 n +1 n +1

2a 2 2 n C r +1 2n Cr +1 2(r + 2)
RHS = a + a = = n +1 =
2 3
n
Cr +1 + n Cr + 2 Cr + 2 n +1
Hence R.H.S. = L.H.S

Page # 4.
Example : 12
Prove that following (Cr = nCr)
(a) C1 + 2C2 + 3C3 + .......... n Cn = n 2n–1
(b) C1 – 2C2 + 3C3 + – ......... = 0
(c) C0 + 2C1 + 3C2 +........ + (n + 1) Cn = (n + 2) 2n–1
Solution
Consider the identity : (1 + x)n = C0 + C1x + C2x2 + ........ + Cnxn
Differentiating w.r.t. x, we get another identity n(1 + x)n–1
= C1 + 2C2 x + 3 C3x2 + ......... + nCn xn–1 ................(i)
(a) substituting x = 1 in (i), we get :
C1 + 2 C2 + 3C3 + ........ + nCn = n 2n–1 .............(ii)
(b) Substituting x = –1 in (i), we get
C1 – 2C2 + 3C3 – 4C4 + ......... + nCn (–1)n–1 = 0
(c) LHS = C0 + 2C1 + 3C2 + ..... + (n + 1)Cn = (C0 + C1 + C2 + ......) + (C1 + 2C2 + 3C3 + ...... + nCn)
= 2n + n 2n–1 = (n + 1) 2n–1 [using (ii)]
This can also be proved by multiplying (i) by x and then differentiating w.r.t. x and then substituting x = 1.

Example : 13
Prove that

C0 C1 C2 C3 Cn 2n+1 − 1
(a) + + + + ........ + =
1 2 3 4 n +1 n +1

C1 C2 C3 Cn 4n+1 − 1
(b) 3C0 + 32 + 33 + 34 + ...... + 3n+1 =
2 3 4 n +1 n +1
Solution
Consider the identity :
(1 + x)n = C0 + C1x + C2 x2 + ......... + Cnxn ............(i)
(a) Integrating both sides of (i) within limits 0 to 1, we get
1 1

∫ (1 + x ) ∫ (C + C1x + ........Cn x n ) dx
n
dx = 0
0 0

1 1
(1 + x )n +1 ⎤ C x2 C x3 C n x n +1 ⎤
n + 1 ⎦⎥
⎥ = C0 x + 1 + 2 + ......... + n + 1 ⎥
0 2 3 ⎦⎥ 0

2n+1 − 1 C1 C2 Cn
= C0 + + + ......... +
n +1 2 3 n +1
(b) Integrating both sides of (i) within limits – 1 to + 1, we get:
1 1

∫
−1
(1 + x )n dx = ∫ (C
−1
0 + C1x + ........ + Cn x n ) dx

1 +1
(1 + x )n +1 ⎤ C x2 C2 x 3 Cn x n +1 ⎤
n + 1 ⎥⎦
⎥ = C0 x + 1 + + .......... + n + 1 ⎥
−1 2 3 ⎥⎦ −1

2n+1 − 0 ⎛ C1 C 2 C ⎞ ⎛ C C ⎞
= ⎜ C0 + − + ..... + n ⎟ – ⎜ − C 0 + 1 − 2 + ....... ⎟
n +1 ⎝ 2 3 n + 1⎠ ⎝ 2 3 ⎠

2n+1 2C 2 2C 4
⇒ = 2C0 + + + ..........
n +1 3 5

2n C2 C4
⇒ = C0 + + + .........
n +1 3 5
Hence proved
Page # 5.
 Note : If the sum contains C0, C1, C2, C3 .......Cn (i.e. all +ve coefficients), then integrate between limits 0
to 1. If the sum contains alternate plus and minus (+ – signs), then integrate between limits – 1 to
0. If the sum contains even coefficients (C0, C2, C4 .....), then integrate between – 1 and +1.

Example : 15
12 C1 + 22 C2 + 32 C3 + ......... + n2 Cn = n(n + 1) 2n–2
Solution
Consider the identity :
(1 + x)n = C0 + C1x + C2 x2 + ........... + Cn xn
Differentiating both sides w.r.t. x;
n(1 + x)n–1 = C1 + 2C2 x + ......... + nCn xn–1
multiplying both sides by x.
n x (1 + x)n–1 = C1 x + 2 C2 x2 + .......... + n Cn xn
differentiate again w.r.t. x;
nx (n – 1) (1 + x)n–2 + n (1 + x)n–1 = C1 + 22 C2 x + .......... + n2 Cn x
substitute x = 1 in this identity
n(n – 1) 2n–2 + n 2n–1 = C1 + 22 C2 + 32 C3 + ........... + n2 Cn
⇒ n 2n–2 (n + 1) = C1 + 22 C2 + .............. + n2 Cn
Hence proved

Example : 16
If 2nCr = Cr , prove that : C12 – 2C22 + 3C32 – + ........... – 2n C2n2 = (–1)n–1 nCn .
Solution
Consider
(1 – x)2n = C0 – C1 x + C2x2 – + ........... + C2n x2n ........(i)
and
(x + 1)2n = C0 x2n + C1 x2n–1 + C2 x2n–2 + ......... + C2n–1 x + C2n ........(ii)
We will differentiate (i) w.r.t. x and then multiply with (ii)
Differentiating (i), we get :
– 2n (1 – x)2n–1 = – C1 + 2 C2 x – 3 C3x2 + ........... + 2n C2n x2n–1
⇒ 2n (1 – x) 2n–1
= C1 – 2 C2 x + 3 C3 x2 – + ....... – 2n C2n x2n–1
new multiplying with (ii)
2n (1 – x)2n–1 (x + 1)2n = (C0 x2n + C1 x2n–1 + ....... + C2n) × (C1 – 2 C2 x + 3 C3 x2 – + ......... – 2n C2n x2n–1)
Comparing the coefficients of x2n–1 on both sides; coefficient in RHS
= C12 – 2 C22 + 3 C32 – + ..... – 2n C2n2
Required coeff. in LHS = coeff. of x2n–1 in 2n (1 – x)2n–1 (1 + x)2n–1 (1 + x)
= coeff. of x2n–1 in 2n (1 – x2)2n–1 + coeff. of x2n–1 in 2nx (1 – x2)2n – 1
= coeff. of x2n–1 in 2n (1 – x2)2n–1 + coeff. of x2n–2 in 2n (1 – x2)2n–1
Now the expansion of (1 – x2)2n–1 contains only even powers of x.
Hence coefficients in LHS :
= 0 + 2n [coeff. of x2n–2 in (1 – x2)2n–1]
= 2n [2n–1Cn–1 (–1)n–1]

⎛ ( 2n − 1)! ⎞
= 2n ⎜⎜ ( −1)n −1 ⎟⎟
⎝ ( n − 1)! n! ⎠
= n 2nCn (–1)n–1
Now equating the coefficients in RHS and LHS, we get C12 – 2C22 + 3C32 – + ........ 2n C2n2 = (–1)n–1 n2nCn

Example : 17
Find the sum of series :
n
⎛ 1 3r 7r 15 r ⎞
∑ (−1)
r =0
r
n ⎜
⎝2 2 2 2
⎟
Cr ⎜ r + 2r + 3r + 4r + .......m terms ⎟
⎠
Solution

Page # 6.
 n r n r n
∑ (−1)
r =0
r
n
⎛ 1⎞
Cr ⎜ ⎟ =
⎝2⎠
∑
r=0
n
Cr ⎛⎜ − 1 ⎞⎟ = expansion of ⎛⎜1 − 1 ⎞⎟
⎝ 2⎠ ⎝ 2⎠

n
⎛ 3r ⎞ n r n
∑
r =0
( −1)r nC ⎜
r ⎜ 2 2r
⎝
⎟
⎟ =
⎠
∑
r=0
n
Cr ⎛⎜ − 3 ⎞⎟ = expansion of ⎛⎜1 − 3 ⎞⎟
⎝ 4⎠ ⎝ 4⎠

n
⎛ 7r ⎞ n r n
∑
r =0
( −1)r nC ⎜
r ⎜ 2 3r
⎝
⎟
⎟ =
⎠
∑
r=0
n
Cr ⎛⎜ − 7 ⎞⎟ = expansion of ⎛⎜1 − 7 ⎞⎟ and so on ............
⎝ 8⎠ ⎝ 8⎠
Now adding all these we get ;
n
⎛ 1 3r 7r 15 r ⎞
Required Sum = ∑
r =0
( −1)r nC ⎜ +
r ⎜
⎝2
r
2 2r
+
2 3 r
+ 4r + ........m terms ⎟
2 ⎟
⎠

n n n
⎛ 1⎞ ⎛ 3⎞ ⎛ 7⎞
= ⎜1 − ⎟ + ⎜1 − ⎟ + ⎜1 − ⎟ + ..... m terms
⎝ 2⎠ ⎝ 4⎠ ⎝ 8⎠

1 1 1
= + + + ....... m terms of GP
2 n
4 n
8n

1 ⎛ 1 ⎞
⎜1 − mn ⎟
2 ⎝ 2 ⎠
n
2mn − 1
= 1 = n
1− n (2 − 1)2mn
2

Example : 18
If (1 + x)n = C0 + C1 x + C2x2 + ........... + Cn xn then show that the sum of the products of the Cis taken two
(2n)!
at a time represented by : ∑ ∑ CC
0 ≤i< j≤n
i j is equal to 22n–1 – 2n! n!

Solution
The square of the sum of n terms is given by :

(C0 + C1 + C2 + ....... Cn)2 = (C02 + C12 + C22 + .......... + Cn2) + 2 ∑ ∑ CC

0 ≤i< j≤n
i j

substituting C0 + C1 + C2 + ......... + Cn = 2n
and C02 + C12 + C22 + ........ + Cn2 = 2nCn

22n − 2n Cn (2n)!
we get (2n)2 = 2nCn + 2 ∑∑
0 ≤i< j≤n
Ci C j ⇒ ∑∑
0 ≤i< j≤n
Ci C j =
2
= 22n–1 – 2n! n!

Example : 19
If (2 + √3)n = Ι + f where Ι and n are positive integers and 0 < f < 1, show that Ι is an odd integer and
(1 – f) (Ι + f) = 1.
Solution
(2 + √3) n = f′ where 0 < f′ < 1 because 2 – √3 is between 0 and 1
Adding the expansions of (2 + √3)n and (2 – √3)n , we get ; 1 + f + f′ = (2 + √3)n + (2 – √3)n
= 2 [C0 2n + C2 2n–2 (√3)2 + .....] = even integer ...........(i)
⇒ f + f′ is also an integer
now 0 < f < 1 and 0 < f′ < 1 ⇒ 0 < f + f′ < 2
The only integer between 0 and 2 is 1
Hence f + f′ = 1 ............(ii)
Consider (i)
1 + f + f′ = even integer
⇒ Ι + 1 = even integer [using (ii)]
Page # 7.
 ⇒ Ι = odd integer
also (Ι + f) (Ι – f) = (Ι + f) (f′) = (2 + √3)n (2 – √3)n = 1

Example : 20
If (6√6 + 14)2n+1 = P, prove that the integral part of P is an even integer and P f = 202n+1 where f is the
fractional part of P.
Solution
Let Ι be the integral part of P
⇒ P = Ι + f = (6√6 + 14)2n+1
Let f′ = (6√6 – 14) lies between 0 and 1, 0 < f′ < 1
subtracting f′ from Ι + f to eliminate the irrational terms in RHS of (i)
Ι + f – f′ = (6√6 + 14)2n+1 – (6√6 – 14)2n+1 = 2[2n+1C1 (6√6)2n (14) + 2n+1C3 (6√6)2n–2 (14)3 + .........]
= even integer .............(ii)
⇒ f – f′ is an integer
now 0<f<1 and 0 < f′ < 1
⇒ 0<f<1 and – 1 < – f′ < 0
adding these two, we get; – 1 < f – f′ < 1
⇒ f – f′ = 0 .............(iii)
Consider (ii)
1 + f – f′ = even integer
⇒ Ι + 0 = even integer [using (iii)]
⇒ integral part of P is even
Also P f = (Ι + f) f = (1 + f) f′ = (6√6 + 14)2n+1 (6√6 – 14)2n+1 = 216 – 196)2n+1 = 202n+1

Example : 21
2−x
Expand in ascending powers of x and find xr. Also state the range of x for which this e x -
(1 − x )(3 − x )
pression is valid.
Solution
2−x
Given expression =
(1 − x )(3 − x )
On expressing RHS in the form of partial fractions, we get
1 1
Given expression = +
2(1 − x ) 2(3 − x )

−1
1 1 ⎛ x⎞
⇒ Given expression = (1 – x)–1 + ⎜1 − ⎟
2 6 ⎝ 3⎠
Using the expansions of (1 – x)–1 , we get

1 ⎛⎜1 + x + x + x + ........ ⎞⎟
2 3
1
6 ⎜⎝ ⎟
2 3
Given expression = (1 + x + x + x + ...........) + 3 9 27
2 ⎠

⎛ 1 1⎞ ⎛1 1 ⎞ ⎛1 1 ⎞ ⎛1 1 ⎞
⇒ Given expansion = ⎜ + ⎟ + ⎜ + ⎟ x+ ⎜ + ⎟ x2 + ....... + ⎜ + r ⎟ xr + ......
⎝2 6⎠ ⎝ 2 18 ⎠ ⎝ 2 54 ⎠ ⎝ 2 63 ⎠

2 5 14 2 1 ⎛1 + 1 ⎞ r
⇒ Given expression = + x+ x + ......... + ⎜ r +1
⎟ x + .......
3 9 27 2 ⎝ 3 ⎠

1 ⎛1 + 1 ⎞ r
Coefficient of xr = ⎜ ⎟ x
2 ⎝ 3 r +1 ⎠
Since (1 – x)–1 is valid for x ∈ (–1, 1) and (1 – x/3)–1 is valid for x ∈ (–3, 3), the given expression is valid for
x ∈ (–1, 1) (i.e. take intersection of the two sets)

Page # 8.
 2−x
Hence is valid for – 1 < x < 1
(1 − x )(3 − x )

Example : 22
3 3.5 3.57
If y = + + + .......... till infinity, show that y2 + 2y – 7 = 0
4 4.8 4.812
Solution
3 3.5 3.57
It is given that : y = + + + ....... to ∞
4 4.8 4.812
On adding 1 to both sides, we get :
3 3.5 3.57
1+y=1+ + + + ......... to ∞ ..............(i)
4 4 .8 4.812
Now we will find the sum of series on RHS or (i)
For this consider the expansion of (1 + t)n , where n is negative or fraction :
n(n − 1) 2 n(n − 1)(n − 2) 3
(1 + t)n = 1 + nt + t + t + ........ to ∞ where |t| < 1 ..............(ii)
1.2 1 . 2 .3
On comparing (i) and (ii), we get
nt = 3/4 ..............(iii)
n(n − 1) 2 3.5
t = ..............(iv)
1.2 4 .8
and (1 + t)n = 1 + y
n(n − 1) 2 3.5
Consider (iv) : t =
1.2 4 .8

(n − 1)t 5
⇒ = [using (iii)]
2 8

5
⇒ (n – 1) t =
4

5
⇒ nt – t =
4

3 5
⇒ –t= [using (iii)]
4 4
⇒ t = – 1/2 and n = – 3/2
−3 / 2
⎛ 1⎞
⇒ Sum of series on RHS of (i) = ⎜1 − ⎟
⎝ 2⎠
⇒ 1 + y = (1 – 1/2)–3/2 ⇒ 23/2 = 1 + y
On squaring, we get 8 = (1 + y)2
⇒ y2 + 2y – 7 = 0
Hence proved

Example : 23
Find the coefficient of x12 x2 x3 in the expansion of (x1 + x2 + x3)4 .
Solution
To find the required coefficient, we can use multinomial theorem in the question.

Page # 9.
 4!
The coefficient of x12 x2 x3 in the expansion of (x1 + x2 + x3)4 = 2! 1! 1! = 12

Hence coefficient of x12 x2 x3 = 12

Note : Also try to solve this question without the use of multinomial theorem

Example : 24
Find the coefficient of x7 in the expansion of (1 + 3x – 2x3)10 .
Solution
Using the multinomial theorem, the general term of the expansion is :
10!
Tp,q,r = p! q! r! (1)p (3x)q (–2x3)r,

where p + q + r = 10. Find the coefficient of x7 , we must have q + 3r = 7.

Consider q + 3r = 7
From the above relationship, we can find the possible values which p, q and r can take
Take r = 0
⇒ q = 7 and p = 3
⇒ (p, q, r) ≡ (3, 7, 0) ...........(i)
Take r = 1
⇒ q = 4 and p=5
⇒ (p, q, r) ≡ (5, 4, 1) ...........(ii)
Take r = 2
⇒ q = 1 and p=7
⇒ (p, q, r) ≡ (7, 1, 2) ...........(iii)
If we take r > 2, we get q < 0, which is not possible.
Hence (i), (ii) and (iii) and the only possible combination of values which p, q and r can take.
10! 10! 10!
Using (i), (ii) and (iii), coefficient of x7 = 1! 3! 7! 37 + 5! 4! 1! 34 (–2)1 + 7! 2! 1! 31 (–2)2 = 62640

Hence coefficient of x7 = 62640

Example : 25
Find the coefficient of x50 in the expansion : (1 + x)1000 + 2x (1 + x)999 + 3x2 (1 + x)998 + ....... + 1001x1000.
Solution
It can be easily observed that series is an Arithmetic-Geometric series with common difference = 1,
common ratio = x/(1+x) and number of terms = 1001
Let S = (1 + x)1000 + 2x (1 + x)999 + 3x2 (1 + x)998 + ....... + 1001x1000 ........(i)
Multiple both sides by x/(1 + x) to get
xS/(1 + x) = x (1 + x)999 + 2x2 (1 + x)998 + 3x3 (1 + x)997 + ....... 1000x1000 + 1001x1001/(1 + x) ........(ii)
Shift (ii) by one term and subtract it from (i) to get :
S/(1 + x) = (1 + x)1000 + x (1 + x)999 + x2 (1 + x)998 + ...... x1000 – 1001x1001 /(1 + x)
⇒ S = (1 + x)1001 + x (1 + x)1000 + x2 (1 + x)999 + ......... x1000 (1 + x) – 1001 x1001
Now the above series, upto the term x1000 (1 + x), is G.P. with first term = (1 + x)1001 , common ratio
= x/(1 + x) and number of terms = 1001

⎡ ⎛ x ⎞1001 ⎤
(1 + x )1001 ⎢1 − ⎜ ⎟ ⎥
1+ x ⎠
⎣⎢ ⎝ ⎦⎥
⇒ S= x – 1001 x1001
1−
1+ x

⇒ S = (1 + x)1002 – x1001 (1 + x) – 1001x1001

Coefficient of x50 in the series S = coeff. of x50 in (1 + x)1002 (Q other terms can not produce x50)
⇒ Coefficient of x50 in the series S = 1002C50
Hence the coefficient of x50 in the given series = 1002C50

Example : 26

Page # 10.
 Find the total number of terms in the expansion of (x + y + z + w)n , n ∈ N.
Solution
Consider the expansion :
(x + y + z + w)n = (x + y)n + nC1 (x + y)n–1 (z + w) + nC2 (x + y)n–2 (z + w)2 + .......... + nCn (z + w)n
Number of terms on the RHS = (n + 1) + n.2 + (n – 1) . 3 + ......... + (n + 1)
n n

∑ nr – ∑ r
n n

∑ (n − r + 1) (r + 1) = ∑
2
= (n + 1) +
r =0 r =0 r =0
r =0

n n n
n(n)(n + 1) n(n + 1)(2n + 1)
= (n + 1) ∑ 1+ n∑ r − ∑ r
r =0 r =0 r =0
2
= (n + 1) (n + 1) +
2
–
6

(n + 1) n +1 2 (n + 1)(n + 2)(n + 3)
= [6(n + 1) + 3n2 – 2n2 – n] = [n + 5n + 6] =
6 6 6
Using multinomial theorem :
n
n! x n1 y n2 zn3 w n 4
(x + y + z + w) = n ∑
r =0
n1! n 2 ! n3 ! n 4 ! , where n1, n2, n3 and n4 can have all possible values for

0, 1, 2, ......, n subjected to the condition n1 + n2 + n3 + n4 = n ..........(i)

Therefore, the number of distinct terms in the multinomial expansion is same as the non-negative integral
solutions of (i)
⇒ Number of distinct terms = Number of non-negative integral solutions
⇒ Number of distinct terms = coefficient of xn in the expansion (1 + x + x2 + ........+ xn)4
4
⎛ 1 − x n+1 ⎞
= coefficient of x in ⎜⎜
n ⎟
⎟
⎝ 1− x ⎠
= coefficient of xn in (1 – xn+1)4 (1 – x)–4 = n+4–1C4–1 = n+3C3
(n + 1)(n + 2)(n + 3)
⇒ Number of distinct terms =
6

Example : 27
Let n be a positive integer and (1 + x + x2)n = a0 + a1x + a2x2 + ........ + a2n x2n .
Show that a02 – a12 – + .... + a2n2 = 2n.
Solution
Consider the given identity : (1 + x + x2)n = a0 + a1x + a2x2 + ........ + a2n x2n .........(i)
Replace x by –1/x in this identity to get :
n
⎛ 1 1 ⎞ a a a
⎜1 − + 2 ⎟ = a – 1 22 – + ...... + 22nn
⎝ x x ⎠ 0
x x x
⇒ (1 – x + x2)n = a0 x2n – a1 x2n–1+ a2 x2n–2 – + ........... + a2n .........(ii)
Multiply (i) and (ii) and also compare coefficient of x2n on both sides to get :
a02 – a12 + a22 – + ....... + a2n2 = coefficient of x2n in (1 + x + x2)n (1 – x + x2)n
⇒ LHS = coefficient of x2n in (1 + x2 + x4)n
⇒ LHS = coefficient of x2n in a0 + a1x2 + a2x4 + ........ + anx2n + ........ + a2nx4n [replace x by x2 in (i)]
⇒ LHS = an
Hence a02 – a12 + a22 – +........ + a2n2 = an

Example : 28

Page # 11.
 2n 2n
If ∑ a ( x − 2)
r =0
r
r
= ∑ b ( x − 3)
r=0
r
r
and ak = 1 for all k ≥ n, show that bn = 2n+1Cn+1 .

Solution
Let y = x – 3 ⇒ y+1=x–2
So given expression reduces to :
2n 2n

∑
r =0
ar ( y + 1)r = ∑ b (y)
r =0
r
r

⇒ a0 + a1 (y + 1) + ......... + a2n (y + 1)2n = b0 + b1y + ......... + b2ny2n

Using ak = 1 for all k ≥ n, we get
⇒ a0 + a1 (y + 1) + ........... an–1 (y + 1)n–1 + (y + 1)n + ........... + (y + 1)2n
= b0 + b1y + ....... + bnyn + ........+ b2ny2n
Compare coefficient of yn on both sides, we get :
n
Cn + n+1Cn + n+2Cn + .......... + 2nCn = bn
Using the formula, nCr = nCn–r, we get :
n
C0 + n+1C1 + n+2C2 + ......... + 2nCn = bn
Using, nC0 = n+1C0 for first term, we get :
n+1
C0 + n+1C1 + n+2C2 + .......... + 2nCn = bn
On combining the first two terms with use of the formula,
n
Cr–1 + nCr = n+1Cr, we get :
n+2
C1 + C2 + ........ + 2nCn = bn
n+2

If we combine terms on LHS like we have done in last step, finally we get :
2n
Cn = bn ⇒ bn = 2n+1Cn+1 (using nCr = nCn–r)
Hence bn = 2n+1Cn+1

Example : 29
k

Prove that ∑ (−3)

r =1
r −1 3n
C 2r −1 = 0 , where k = 3n/2 and n is an even positive integer.

Solution
Let n = 2m ⇒ k = 3m
2m

LHS = ∑ ( −3)
r −1
6m
C2r–1 = 6mC1 – 3 6mC3 + 9 6mC5 – ....... + (–3)3m–1 6mC6m–1 ...........(i)
r =1

Consider (1 + x)6m = 6mC0 + 6mC1x + 6mC2 x2 + .......... + 6mC6m x6m and

(1 – x)6m = 6mC0 – 6mC1x + 6mC2 x2 + ..........+ 6mC6m x6m
On subtracting the above two relationships, we get
(1 + x)6m – (1 – x)6m = 2 (6mC1 x + 6mC3x3 + 6mC5x5 + ......... + 6mC6m–1 x6m–1)
Divide both sides by 2x to get :

(1 + x )6m − (1 − x )6m 6m
= C1 + 6mC3 x2 + ........ + 6mC6m–1 x6m–2
2x
Put x = √3i in the above identity to get :

(1 + i 3 )6m − (1 − i 3 )6m
= 6mC1 – 3 6mC3 + .......... + (–3)3m–1 6mC6m–1 ...........(ii)
2 3i
Comparing (i) and (ii), we get

⎡⎛ π π⎞ ⎛ π π⎞
6m 6m ⎤
2 6m ⎢⎜ cos + i sin ⎟ − ⎜ cos − i sin ⎟ ⎥
⎢⎣⎝ 3 3⎠ ⎝ 3 3⎠ ⎥⎦
LHS =
2 3i

Page # 12.
 2 6m [(cos 2πm + i sin 2πm) − (cos 2πm − i sin 2πm)]
⇒ LHS = (using De morvie’s Law)
2 3i

2 6m 2i sin 2πm 2 6m sin 2πm

⇒ LHS = = =0 (because sin 2 πm = 0)
2 3i 3

Example : 30
Show by expanding [(1 + x)n – 1]m where m and n are positive integers, that
m
C1 nCm – mC2 2nCm + mC3 3nCm .......... = (–1)m–1 nm.
Solution
Consider : [(1 + x)n – 1]m and expand (1 + x)n binomially
⇒ [(1 + x)n – 1]m = [1 + nC1x2 + ......... + nCn xn) – 1]m
⇒ [(1 + x)n – 1]m = [nC1 x + nC2 x2 + ....... + nCn xn]m
⇒ [(1 + x)n – 1]m = xm [nC1 + nC2 x + ........+ nCn xn–1]m ..........(i)
n m m n m
Now consider : [(1 + x) – 1] = (–1) [1 – (1 + x) ]
⇒ [(1 + x)n – 1)m = (–1)m [1 – mC1 (1 + x)n + mC2 (1 + x)2n – ..............] ..........(ii)
Comparing (i) and (ii), we get :
xm [nC1 + nC2x + ......... + nCnxn–1]m [1 – mC1 (1 + x)n + mC2 (1 + x)2n – ........]
Compare coefficient of xm on both sides to get :
nm = (–1)m [–mC1 nCm + mC2 2nCm – mC3 3nCm + ..........]
⇒ m
C1 nCm – mC2 2nCm + mC3 3nCm – + ......... = (–1)m–1 nm
Hence proved

Example : 31
n

∑r
n 1
∑ (−1) r −1 Cr
Show that =
r =1
r r =1

Solution
Consider : (1 – x)n = C0 – C1x + C2x2 – ........... + (–1)n Cn xn
⇒ 1 – (1 – x)n = C1x – C2 x2 + C3 x3 + ........ + (–1)n–1 Cnxn (Q C0 = 1)
Divide both sides by x to get :

1 − (1 − x )n
= C1 – C2 x + C3x2 + ......... + (–1)n–1 Cn xn–1
x
Integrate both sides between limits 0 and 1 to get :
1 1
1 − (1 − x )n
∫0
x = ∫ [C
0
1 − C 2 x + C 3 x 2 + ...... + ( −1)n−1Cn x n −1 ] dx

1 1
1 − (1 − x )n x3 xn ⎤
⇒ ∫
0
x2 n–1 ⎥
1 − (1 − x ) = C1x – C2 2 = C3 3 – ......... + (–1) Cn n ⎥⎦
0

It can be easily observed that integrand on the LHS is the summation of n terms of G.P. whose first term
is 1 and common ratio is (1 – x).
1
( −1)n−1Cn
∫ [1 + (1 − x) + (1 − x)
2 C2 C3
⇒ + ......... + (1 – x)n–1] dx = C1 – + – + ........ +
0 2 3 n

1
(1 − x )2 (1 − x )3 (1 − x )n ⎤ C C ( −1)n−1Cn
⇒ x– – – ........... – ⎥ = C – 2 + 3 – ....... +
2 3 n ⎦⎥ 1
2 3 n
0

1 1 1 C2 C3 ( −1)n−1Cn
⇒ 1+ = + ........... + = C1 – + – .......... =
2 3 n 2 3 n

Page # 13.
 n n

∑ (−1) ∑ r . Hence proved

r −1 Cr 1
⇒ =
r =1 r r =1

Example : 32

C0 C1 C2 C3 n
Cn 4 n n!
Show that – + – + ......... + (–1) =
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 )n−1 dx
4 n −1 4
⇒ Ιn = 4n
4
(1 − x ) dx = 4n
0 0

1 1

∫ (1 − x 4 )n−1 dx – 4n ∫ (1 − x
4 n
⇒ Ιn = 4n ) dx
0 0

⇒ Ιn = 4n Ιn–1 – 4n Ιn
4n
⇒ Ιn = Ι
4n + 1 n–1
Replace n by 1, 2, 3, 4, ........, n–1 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 = 1
0

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 n
Cn 4 n n!
– + – + ........ + (–1) =
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 [Q k is odd]
2
= 24m + 24p
= 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 ....... cos2n–1 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 2k–1 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 2k–1 x cos 2kx =
2k +1 sin x

⎛ sin 2k x ⎞ 2 sin 2k x cos 2k x sin 2k +1 x

⎜ ⎟
LHS = ⎜ k ⎟ cos 2k
x = = = 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
Let P(k) be true ⇒ (1 + x) ≥ 1 + kx
k
.......(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) ≥ 1 + (k + 1)x + kx
k+1 2

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(xn–1 – nan–1) + an (n – 1) is divisible by (x – a)2 for n > 1 and n ∈ N
Solution
Let P(n) : x(xn–1 – nan–1) + 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 (xk–1 – kak–1) + 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 – kx2ak–1 + xak (k – 1)] + kx2 ak–1 – xak(k –1) – kxak – xak + kak+1
= x[x(xk–1 – kak–1) + ak (k – 1)] + kak–1 (x2 – 2ax + a2)
= divisible by (x – a)2 from P(k) + kak–1 (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(xn–1 – nan–1) + 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 n+2 2n 24
Solution
1 1 1 13
Let P(n) : + + ......... + >
n +1 n+2 2n 24

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

1 1 1 13
⇒ + + ......... + >
k+2 k+3 (k + 1) + (k + 1) 24
Using P(k) we have :
1 1 1 13
⇒ + + ......... + >
k +1 k+2 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
⇒ + + ....... + + > + + –
k+2 k+3 2k + 1 2k + 2 24 2k + 1 2k + 2 k +1

1 1 1 13 (2k + 2) + (2k + 1) − 2(2k + 1)

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

1 1 1 13 1
⇒ + .......... + + > +
k+2 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
⇒ + ........ + + >
k+2 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+1
C2 ⎜ ⎟ + .........> 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 Am–1 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 Am–1 cos θ – Am–2 , (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 ⎟ ⎥
Let u1 = 1, u2 = 1 and un+2 = un + un+1 for n ≥ 1. Use induction to show that un = ⎜ ⎟ ⎜ ⎟
5 ⎢⎣⎝ 2 ⎠ ⎝ 2 ⎠ ⎥⎦

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 uk–1 =
⎝ ⎠ ⎦

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 ⎟ ⎥
⇒ uk+2 = ⎢⎜ 2 ⎟ ⎜ 2 ⎟ ⎥ – ⎢⎜ 2 ⎟ ⎜ 2 ⎟ ⎥
5 ⎣⎝ ⎠ ⎝ ⎠ ⎦ 5 ⎣⎝ ⎠ ⎝ ⎠ ⎦

Page # 20.
 ⎡⎛ k
⎞ ⎛ ⎞⎤ ⎡⎛ k
⎞ ⎛ ⎞⎤
1 ⎢⎜ 1 + 5 ⎟ ⎜1 + 1 + 5 ⎟⎥ 1 ⎢⎜ 1 − 5 ⎟ ⎜1 + 1 − 5 ⎟⎥
⇒ uk+2 = ⎢⎜ 2 ⎟ ⎜ 2 ⎟⎥ – ⎢⎜ 2 ⎟ ⎜ 2 ⎟⎠⎥
5 ⎣⎝ ⎠ ⎝ ⎠⎦ 5 ⎣⎝ ⎠ ⎝ ⎦

⎡⎛ k
⎞ ⎛ ⎞ ⎤
2 ⎡⎛ k
⎞ ⎛ ⎞ ⎤
2
1 ⎢⎜ 1 + 5 ⎟ ⎜ 1 + 5 ⎟ ⎥ ⎢⎜ 1 − 5 ⎟ ⎜ 1 − 5 ⎟ ⎥
⇒ ⎜ ⎟ ⎜ ⎟ – ⎢⎜ 2 ⎟ ⎜ 2 ⎟ ⎥
5 ⎢⎣⎝ 2 ⎠ ⎝ 2 ⎠ ⎥⎦
uk+2 =
⎣⎝ ⎠ ⎝ ⎠ ⎦

⎡⎛ ⎞
k +2
⎛ 1− 5 ⎞ ⎤
k+2
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) 2n–2 for n ≥ 1

Solution
n

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

for n = 1 :
k=0
∑k 2 1
Ck = 1 (1 + 1) 21–2

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) 2m–2

m+1

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

m+1 m +1 m m +1

LHS of P(m + 1) : =
k=0
∑ k2 m +1
Ck = ∑
k=0
k 2 (mC + mC ) =
k k–1
∑
k=0
k2 m
Ck + ∑k 2
m
Ck–1
k =1

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

m +1 m m

= m (m + 1) 2 m–2
+ ∑
t=0
t2 m
Ct + 2 ∑
t=0
t mC t + ∑
t=0
m
Ct

using P(k) and C1 + 2C2 + 3C3 + ............nCn = n2n–1

⇒ LHS = m (m + 1) 2m–2 + m (m + 1) 2m–2 + 2 (m2m–1) + 2m = 2m–1 [m(m + 1) + 2m + 2]
= 2m–1 (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!
∑ (n − m)
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 r+2 ⎦

(r + p + 1)! ⎡⎛ n(p + 1) ⎞ ⎛ (p + 1) ⎞⎤
= ⎢⎜ + n⎟ − ⎜ + (p + 1) ⎟⎥
(p + 1)! ⎣⎝ r + 1 ⎠ ⎝ r + 2 ⎠⎦

(r + p + 1)! ⎡ (p + r + 2)n (p + 1)(p + r + 2) ⎤

−
(p + 1)! ⎢⎣ ⎥
=
r +1 r+2 ⎦

(r + p + 2)! ⎡ n (p + 1) ⎤
= ⎢ − ⎥ = RHS of P(p + 1)
(p + 1)! ⎣r + 1 r + 2 ⎦
⇒ 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 2k+3 , but not divisible by 2k+4 as p is odd
⇒ 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 nCk–1 + mC2 nCk–2 + ...... + 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 nCk–1 + mC2 nCk–2 + ........ + mCk nC0 = m+nCk
Consider P(1)
LHS of P(1) = mCk–1 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 sCk–1 + mC2 sCk–2 + ....... + mCk sC0 = m+sCk
Consider LHS of P(s + 1)
LHS of P(s + 1) = mC0 s+1Ck + mC1 s+1Ck–1 + mC2 s+1Ck–2 + ....... + mCk s+1C0
⇒ LHS of P(s + 1) = mC0 (sCk + sCk–1) + mC1 (sCk–1 + sCk–2) + ........ + mCk s+1C0
= [mC0 sCk + mC1 sCk–1 + ....... + mCk sC0] – [mC0 sCk–1 + mC1 sCk–2 + ........ + mCk–1 sC0]
= P(s) + P(s)]where k is replaced by k – 1 in the P(s)
⇒ LHS of P(s + 1) = m+sCk + m+sCk–1 = 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) : α + β is an integer
n n

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 αk–1 + βk–1 both are integers
Consider LHS of P(k + 1) i.e.
LHS of P(k + 1) = αk+1 + βk–1 = (α – β) (αk + bk) – αβ (αk–1 + bk–1)
⇒ 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) : α + b = (α + β) (α + β – αβ) = (p + 1) [(p + 1) – 3] = p[(p + 1)2 – 3] + p(p + 2) – 2
3 3 2 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 , αk–1 and αk+2 + βk–2 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) – αβ (αk–1 + bk–1)
= p(αk – bk) + (αk + bk) – (αk–1 + bk–1)
= p P(k) + [(p + 1) (αk–1 – bk–1) – (αk+2 + bk–2)] – (αk–1 + bk–1)
= 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
dx n ⎝ x ⎠ x n +1 ⎝ 2 n⎠
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 ⎠ x 2 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.
 dk +1 d ⎡ d ⎛ log x ⎞⎤
k
⎛ log x ⎞
LHS of P(k + 1) = ⎜ ⎟ = ⎢ k⎜ ⎟⎥
dx k +1 ⎝ x ⎠ dx ⎢⎣ dx ⎝ x ⎠⎥⎦

d d
= [LHS of P(k)] = [RHS of P(k)] [using (1)]
dx dx

d ⎡ ( −1) k! ⎛ log x − 1 − 1 − ......... − 1 ⎞⎤

k

= ⎢ ⎜ ⎟⎥
dx ⎣⎢ x k +1 ⎝ 2 k ⎠⎦⎥

( −1)k k! ( −1)(k + 1) ⎛ log x − 1 − 1 − ......... − 1 ⎞ ( −1)k k! 1

= ⎜ ⎟ +
k +2
x ⎝ 2 k⎠ x k +1 x

( −1)K +1(K + 1)! ⎛ log x − 1 − 1 − ...... − 1 ⎞

= ⎜ ⎟
XK + 2 ⎝ 2 k + 1⎠
⇒ P(k + 1) is true
Hence by principle of mathematical induction, P(n) is true for all n ∈ N

Example : 53

dn ⎛ 1 1⎞
Use mathematical induction to prove that (xn log x) = n! ⎜ log x + 1 + + ..... + ⎟ for all n ∈ N and
dx n
⎝ 2 n⎠
x > 0.
Solution

dn ⎛ 1 1⎞
Let P(n) : (xn log x) = n! ⎜ log x + 1 + + ..... + ⎟
dx n
⎝ 2 n ⎠

⎛ d ⎞ x
LHS of P(1) = ⎜ ⎟ (x log x) = log x + = log x + 1
⎝ dx ⎠ x
RHS of P(1) = 1! (log x + 1) = log x + 1
⇒ P(1) is true
Let us assume that P(k) is true i.e.

dk ⎛ 1 1⎞
P(k) : (xk log x) = k! ⎜ log x + 1 + + ........ + ⎟ .........(i)
dx k
⎝ 2 k⎠
Consider LHS of P(k + 1) i.e.

dk +1
LHS of P(k + 1) = (xk+1 logx)
dx k +1

dk ⎡ d k +1 ⎤
= ⎢ dx ( x log x )⎥
dx k
⎣ ⎦

dk ⎡ x k +1 ⎤
⎢(k + 1)x log x +
k
= ⎥
dx k ⎣⎢ x ⎥⎦

dk dk ⎡ x k +1 ⎤
= (k + 1) [xk log x] + ⎢ ⎥
dx k dx k ⎢⎣ x ⎥⎦

⎡ 1 1⎤
= (k + 1) ⎢k! (log x + 1 + + ..... + ⎥ + k! [using (i)]
⎣ 2 k ⎦

⎡ 1 1 ⎤
= (k + 1)! ⎢k! (log x + 1 + + ...... +
⎣ 2 k + 1⎥⎦

Page # 26.
 ⇒ P(k + 1) is true
Hence by principle of mathematical induction, P(n) is true for all n ∈ N

Example : 54
π/2
sin 2 nx
∫
1 1 1
Use mathematical induction to prove sin x dx = 1 + 3 + 5 + ......... + 2n − 1 for all n ∈ N.
0

Solution
π/2
sin 2 nx
∫
1 1 1
Consider Ιn = sin x dx = 1 + 3 + 5 + ......... + 2n − 1
0

π/2 π/2
sin 2 nx
from left hand side, Ι1 = ∫
0
sin x dx = ∫ sin x dx = 1
0

from right hand side, Ι1 = 1

⇒ Ι1 is true
Assume that Ιk is true i.e.
π/2
sin 2 kx
∫
1 1 1
Ιk = sin x dx = 1 + 3 + 5 + ....... + 2k − 1 ..........(i)
0

π/2 π/2
sin 2 (k + 1)x sin 2 kx
Consider Ιk–1 – Ιk = ∫
0
sin x dx – ∫
0
sin x dx

π/2 π/2
sin 2 (k + 1)x − sin 2 kx sin( 2k + 1)x sin x
⇒ Ιk+1 – Ιk = ∫
0
sin x dx = ∫
0
sin x dx

π/2
cos( 2k + 1)x ⎤
π/2

= ∫ sin(2k + 1)x dx = −
2k + 1 ⎥
⎥ =
1
2k + 1
0 ⎦0

1 1
⇒ Ιk+1 = Ιk + ⇒ Ιk+1 = Ιk +
2k + 1 2k + 1

1 1 1 1
⇒ Ιk+1 = 1 + + + ........ + + [using (i)]
3 5 2k − 1 2k + 1
⇒ Ιk+1 is true.
Hence by principle of mathematical induction Ιn is true for all values of n ∈ N

Example : 55
π
1 − cos nx
Let Ιn = ∫
0
1 − cos x dx. Use mathematical induction to prove that Ιn = nπ for all n = 0, 1, 2, 3, ....

Solution
π
1 − cos nx
We have to prove Ιn = ∫0
1 − cos x dx = nπ

For n = 0
π π
1 − cos θ
Ι0 = ∫
0
1 − cos x dx = ∫ 0 dx = 0 .
0

The value of the integral from the RHS = 0 × π = 0

Page # 27.
⇒ The given integral is true for n = 0
From n = 1
π π
1 − cos x
Ι1 = ∫
0
1 − cos x dx = ∫ dx = π
0

The value of the integral from the RHS = 1 × π = π

⇒ The given integral is true for n = 1
Assume that the given integral is true for n = k – 1 and n = k i.e.
π
1 − cos(k − 1)x
Ιk–1 = ∫
0
1 − cos x dx = (k – 1) π .........(i)

π
1 − cos kx
Ιk = ∫
0
1 − cos x dx = kπ .........(ii)

π
cos kx − cos(k + 1)x
Consider Ιk+1 – Ιk = ∫
0
1 − cos x dx

π
x 2k + 1 2k + 1
2 sin sin x π sin x
⇒ Ιk+1 – Ιk = ∫ 2
2 sin2
x
2
dx = ∫ 2
x
dx ..........(iii)
0 0 sin
2 2

π
cos(k − 1)x − cos kx
Consider Ιk – Ιk–1 = ∫
0
1 − cos x dx

π
x 2k − 1 2k − 1
2 sin sin x π sin x
⇒ Ιk – Ιk–1 = ∫ 2
2 sin2
x
2
dx = ∫ 2
x
dx ..........(iv)
0 0 sin
2 2
Subtracting (iv) from (iii), we get :

2k + 1 2k − 1
π sin x − sin x
Ιk+1 – 2 Ιk + Ιk–1 = ∫
0
2
sin
x
2
dx
2

x π
sin kx ⎤
π x
2 cos kx sin
⇒ Ιk–1 – 2 Ιk + Ιk–1 = ∫ x
2
dx = 2 ∫ cos kx dx = 2
k ⎥
⎥ =0
0 sin 0 ⎦0
2
⇒ Ιk+1 = 2Ιk – Ιk–1 = 2kπ – (k – 1)π [using (i) and (ii)]
⇒ Ιk+1 = (k + 1) π
⇒ The given integral is true for n = k + 1
Hence, by principle of mathematical induction, the given integral is true for all n = 0, 1, 2, 3, .......

Page # 28.