Binomial Sol
Binomial Sol
Binomial Sol
Binomial Theorem
Assignment – Suggested Solution
1. (a) Tr +1 ≤ Tr
r r −1
⎛2⎞ ⎛2⎞
C ⎜ ⎟ ≤ C rkn−1 ⎜ ⎟
kn
r
⎝k⎠ ⎝k⎠
(kn )! ⎛2⎞
r
(kn )! ⎛2⎞
r −1
⎜ ⎟ ≤ ⎜ ⎟
r!(kn − r )! ⎝ k ⎠ (r − 1)!(kn − r + 1)! ⎝ k ⎠
1⎛2⎞ 1
⎜ ⎟≤
r ⎝ k ⎠ kn − r + 1
2kn − 2r + 2 ≤ rk
r (k + 2) ≥ 2(kn + 1)
2(kn + 1)
r≥
k+2
(b) For Tr+1 ≥ Tr,
2(51 + 1)
r≥ = 20.8
3+ 2
Therefore, T1 ≤ T2 ≤ … ≤ T21 and T52 ≤ T50 ≤ … ≤ T21
20
⎛2⎞ 51
∴ The greatest term = T21 = C ⎜ ⎟ 20
⎝3⎠
2. Method 1:
When m = 0, C nn = 1 = C nn++11 .
C nn + C nn +1 + C nn + 2 + K + C nn + k + C nn + k +1 = C nn++1k +1 + C nn + k +1 = C nn++1k + 2
3. (a) (1 + x )n = C 0n + C1n x + C 2n x 2 + K + C nn x n
Put x = 1,
(1 + 1)n = 1 + C1n + C 2n + K + C nn
C1n + C 2n + K + C nn = 2 n − 1
d (1 + x )
( )
n
d
(b) = C 0n + C1n x + C 2n x 2 + K + C nn x n
dx dx
n(1 + x )
n −1
= C1n + 2C 2n x + K + nC nn x n −1
Put x = 1,
n(1 + x )
n −1
(c) = C1n + 2C 2n x + K + nC nn x n −1
nx(1 + x )
n −1
= C1n x + 2C 2n x 2 + K + nC nn x n
Put x = 1,
∑C
k =0
n
r +k C nn− k = C n2+nr
n−r
∑C
k =0
n
r +k C kn = C n2+nr
f (r ) = C n2+nr
Pure Mathematics – Binomial Theroem p.3
∑C
k =0
n
k C n2−nk = C n3n
n
∑C
k =0
n
k C n2+nk = C n3n
n
∑ C f (k ) = C
k =0
n
k
3n
n
n
5. (a) (i) (1 + x )n = ∑ C rn x r
r =0
Put x = -1,
n
∑ (− 1) C = (1 − 1) = 0
r n r
r
r =0
(ii)
1 ⎡ (n + 1)!
r
[
1 n +1
C r − C rn = ⎢ ] −
n! ⎤
r ⎣ r!(n + 1 − r )! r!(n − r )!⎥⎦
1 n! n + 1 − (n + 1 − r )
= ⋅ ⋅
r r! (n + 1 − r )!
1 n! r
= ⋅ ⋅
r r! (n + 1 − r )!
n!
=
r!(n + 1 − r )!
=
1
⋅
(n + 1)!
n + 1 r!(n + 1 − r )!
1
= C rn +1
n +1
Pure Mathematics – Binomial Theroem p.4
(b) (i)
F (n + 1) − F (n ) = ∑
n +1
(− 1)r −1 C n+1 − n
(− 1)r −1 C n
r =1 r
r ∑
r =1 r
r
= ∑⎢
n ⎡
(− 1)r −1 C n+1 − (− 1)r −1 C n ⎤ + (− 1)n+1−1 C n+1
r ⎥ n +1
n +1
r
r =1 ⎣ r r ⎦
=∑
n
(− 1)r −1 [C n+1 − C n ] + (− 1)n
n +1
r r
r =1 r
=∑
n
(− 1)r −1 C n+1 + (− 1)n
n +1 n +1
r
r =1
(− 1)r C rn+1 + (− 1)
n
1 n
=− ∑
n + 1 r =1 n +1
1 ⎡ n +1
(− 1)r C rn+1 − (− 1)0 C0n+1 − (− 1)n+1 C nn++11 ⎤⎥ + (− 1)
n
=− ⎢ ∑
n + 1 ⎣ r =0 ⎦ n +1
=−
1
[
0 − 1 + (− 1) +
n (− 1) ]
n
n +1 n +1
=−
1
n +1
[
0 − 1 + (− 1) − (− 1)
n n
]
1
=
n +1
(ii)
n −1
F (n ) − F (1) = ∑ [F (r + 1) − F (r )]
r =1
n
(− 1) r −1
(− 1) 0
C1 n −1
1
∑
r =1 r
n Cr −
1
1
=∑
r =1 r + 1
.
n
(− 1) r −1
1 n
∑r =1 r
n Cr − 1 = ∑
r =2 r
n
(− 1)r −1 n
1 n
1
∑ r =1 r
C
n r = ∑
r =2 r
+ 1 = ∑
r =1 r
(ii)
n n n −1
⎛ n −1 n −1
⎞
∑r 2
C rn = ∑ nrC rn−−11 = n∑ (r + 1)C rn −1 = n⎜ ∑ rC rn −1 + ∑ C rn −1 ⎟
r =1 r =1 r =0 ⎝ r =0 r =0 ⎠
[ ]
= n (n − 1)2 n − 2 + 2 n −1 = n ⋅ 2 n − 2 (n − 1 + 2) .
= n(n + 1)2 n−2
Pure Mathematics – Binomial Theroem p.5
(b) n 2 C 0n + (n − 2 ) C1n + (n − 4 ) C 2n + K + (n − 2n ) C nn
2 2 2
( )
n n
= ∑ (n − 2r ) C = ∑ n 2 − 4nr + 4r 2 C rn
2 n
r
r =0 r =0
n n n
= n 2 ∑ C rn − 4n∑ rC rn + 4∑ r 2 C rn
r =0 r =1 r =1
= n ⋅ 2 − 4n ⋅ 2
2 n 2 n −1
+ 4n(n + 1) ⋅ 2 n − 2
= n 2 ⋅ 2 n − n 2 ⋅ 2 n +1 + n(n + 1) ⋅ 2 n = n ⋅ 2 n (n − 2n + n + 1)
= n ⋅ 2n
∴ a0 + a2 + K a2n =
(− 1) + 9 n
n
2
(iii) Diff. (2x – 5x + 2) = a0 + a1x + a2x2 + … + a2nx2n w.r.t. x.
2 n
= 2n(− 1) + (− 1)
n n
= (− 1) (2n + 1)
n