Binomial Theorem (For A Positive Integral Index)
Binomial Theorem (For A Positive Integral Index)
\
|
+ term.
(b) if n is odd, then there are two middle terms, i.e.
th
1
2
n
|
.
|
\
|
+ term and
th
2
3 n
|
.
|
\
| +
term.
The greatest term in the expansion of (x + a)
n
,
x, a R and x, a > 0 can be obtained as below :
r
1 r
T
T
+
=
x
a
r
1 r n +
or
r
1 r
T
T
+
1 =
rx
) x a ( r a ) 1 n ( + +
=
)
`
+
+ +
r
x a
a ) 1 n (
rx
) x a (
=
rx
x a +
|k r|,
where k =
x a
a ) 1 n (
+
+
Now, suppose that
(i) k =
x a
a ) 1 n (
+
+
is an integer. We have
T
r + 1
> T
r
r
1 r
T
T
+
> 1 r < k (i.e. 1 r < k)
Along , T
r + 1
= T
r
r
1 r
T
T
+
= 1 r = k,
i.e. T
k + 1
= T
k
> T
k1
> .... > T
3
> T
2
> T
1
In this case there are two greatest terms T
k
and
T
k+1
.
(ii) k =
x a
a ) 1 n (
+
+
is not an integer. Let [k] be the
greatest integer in k. We have
T
r+1
> T
r
r
1 r
T
T
+
r < k = [k] + (fraction)
r [k]
i.e. T
1
< T
2
< T
3
< ..... < T
[k] 1
< T
[k]
< T
[k] + 1
In this case there is exactly one greatest term viz.
([k] + 1)
th
term.
Term independent of x in the expansion of
(x + a)
n
Let T
r + 1
be the term independent of x.
Equate to zero the index of x and you will find the
value of r.
The number of term in the expansion of
(x + y + z)
n
is
2
) 2 n )( 1 n ( + +
, where n is a positive
integer.
Pascal Triangle
In(x + a)
n
when expanded the various coefficients
which occur are
n
C
0
,
n
C
1
,
n
C
2
, .... The Pascal triangle
gives the values of these coefficients for n = 0, 1, 2,
3, 4, 5, ....
n = 0 1
n = 1 1 1
n = 2 1 2 1
n = 3 1 3 3 1
n = 4 1 4 6 4 1
n = 5 1 5 10 10 5 1
n = 6 1 6 15 20 15 6 1
n = 7 1 7 21 35 35 21 7 1
n = 8 1 8 28 56 70 56 28 8 1
MANISH KALIA'S MATHEMATICS CLASSES 9878146388
BINOMIAL THEOREM
XtraEdge for IIT-JEE 52 SEPTEMBER 2009
Rule : It is to be noted that the first and least terms in
each row is 1. The terms equidistant from the
beginning and end are equal. Any number in any row
is obtained by adding the two numbers in the
preceding row which are just at the left and just at the
right of the given number, e.g. the number 21 in the
row for n = 7 is the sum of 6 (left) and 15 (right)
which occur in the preceding row for n = 6.
Important Cases of Binomial Expansion :
If we put x = 1 in (1), we get
(1 + a)
n
=
n
C
0
+
n
C
1
a +
n
C
2
a
2
+ ..................
+
n
C
r
a
r
+ ...........
n
C
n
a
n
...(2)
If we put x = 1 and replace a by a, we get
(1 a)
n
=
n
C
0
n
C
1
a +
n
C
2
a
2
..................
+ (1)
r
n
C
r
a
r
+ .... + (1)
n
n
C
n
a
n
...(3)
Adding and subtracting (2) and (3), and then
dividing by 2, we get
2
1
{(1 + a)
n
+ (1 a)
n
} =
n
C
0
+
n
C
2
a
2
+
n
C
4
a
4
+ .... ...(4)
2
1
{(1 + a)
n
(1 a)
n
} =
n
C
1
a +
n
C
3
a
3
+
n
C
5
a
5
+ ...... ...(5)
Properties of Binomial Coefficients :
If we put a = 1 in (2) and (3), we get
2
n
=
n
C
0
+
n
C
2
+ ...... +
n
C
r
+ ....+
n
C
r
+ .....
n
C
n1
+
n
C
n
and 0 =
n
C
0
n
C
1
+
n
C
2
...... + ...... + (1)
n
n
C
n
n
C
0
+
n
C
2
+ .... =
n
C
1
+
n
C
3
+ .... =
2
1
[2
n
0]
= 2
n 1
...(6)
Due to convenience usually written as
C
0
+ C
2
+ C
4
+ ... = C
1
+ C
3
+ C
5
+ .... = 2
n 1
and C
0
+ C
1
+ C
2
+ C
3
+ ...... + C
n
= 2
n
Where
n
C
r
C
r
=
! ) r n ( ! r
! n
=
! r
) 1 r n )...( 2 n )( 1 n ( n +
Some other properties to remember :
C
1
+ 2C
2
+ 3C
3
+ ... + nC
n
= n . 2
n 1
C
1
2C
2
+ 3C
3
.... = 0
C
0
+ 2C
1
+ 3C
2
+ ... + (n + 1)C
n
= (n + 2) 2
n 1
C
0
C
r
+ C
1
C
r+1
+ ... + C
n r
C
n
=
! ) r n ( . ! ) r n (
! ) n 2 (
+
C
0
2
+ C
1
2
+ C
2
2
+ .... + C
n
2
=
2
) ! n (
! ) n 2 (
C
0
2
C
1
2
+ C
2
2
C
3
2
+ ...
=
even is n if , C . (1)
odd is n if , 0
2 / n
n n/2
Binomial Theorem for Any Index :
The binomial theorem for any index states that
(1 + x)
n
= 1 +
! 1
nx
+
! 2
) 1 n ( n
x
2
+
! 3
) 2 n )( 1 n ( n
x
3
+ ..... ...(7)
Where n is any index (positive or negative)
The general term in expansion (7) is
T
r + 1
=
! r
) 1 r n )......( 1 n ( n +
x
r
In this expansion there are infinitely many terms.
This expansion is valid for |x| < 1 and first term
unity.
When x is small compared with 1, we see that the
terms finally get smaller and smaller. If x is very
small compared with 1, we take 1 as a first
approximation to the value of (1 + x)
n
or 1 + nx as
a second approximation.
Replacing n by n in the above expansion, we get
(1 + x)
n
= 1 nx +
! 2
) 1 n ( n +
x
2
! 3
) 2 n )( 1 n ( n + +
x
3
+ ... + (1)
r
! r
) 1 r n )...( 2 n )( 1 n ( n + + +
x
r
+ ...
Replacing x by x in this expansion, we get
(1 x)
n
= 1 + nx +
! 2
) 1 n ( n +
x
2
+
! 3
) 2 n )( 1 n ( n + +
x
3
+
....... +
! r
) 1 r n )...( 2 n )( 1 n ( n + + +
x
r
+ ....
Important expansions for n = 1, 2 are :
(1 + x)
1
= 1 x + x
2
x
3
+ ...+ (1)
r
x
r
+ .... to
(1 x)
1
= 1 + x + x
2
+ x
3
+ ..... + x
r
+ .... to
(1 + x)
2
= 1 2x + 3x
2
.... + (1)
r
(r + 1)x
r
+
....to
(1 x)
2
= 1 + 2x + 3x
2
+ ..... + (r + 1)x
r
+ .... to
(1 + x)
3
= 1 3x + 6x
2
10x
3
+ ...
+ (1)
r
! 2
) 2 r )( 1 r ( + +
x
r
+ .....
(1 x)
3
= 1 + 3x + 6x
2
+ 10x
3
+ ...
...... +
! 2
) 2 r )( 1 r ( + +
x
r
+ ....
MANISH KALIA'S MATHEMATICS CLASSES 9878146388