Unit 4

The Binomial Theorem

4.1 Recognition of Permutation and Combination
A. Permutation
If one operation can be performed in m ways, and
then a second can be performed in n ways, and then
a third in p ways, and then a fourth in q ways, and
so on, the number of ways of performing all the
operations in succession will be m x n x p x q x
e.g. 4 teams in a competition
Team A can be in rank 1, 2, 3 or 4
As team A in rank 1, then team B should be in
2, 3 or 4, team C in either remaining two ranks,
team D in remaining only rank.
Permutation = 4 x 3 x 2 x 1 = 24
4.1 Recognition of Permutation and Combination
A. Permutation
The symbols
n
P
r
or
n
P
r
or P
n
r
or P(n, r) are
usually taken to denote the total number of
permutations of n different objects taken r at a
time.
. 0 , ) 1 )...( 2 )( 1 ( n r where r n n n n P
n
r
s < + =
r factors
e.g.
14
P
4
= 14 x 13 x 12 x 11 = 24024
4.1 Recognition of Permutation and Combination
A. Permutation
Let n be a positive integer, the symbol n! is to
denote the product of the first n consecutive
positive integers.
i.e. n! = n(n - 1)(n - 2).3 x 2 x 1
e.g. 4! = 4 x 3 x 2 x 1
0! = ??
(-3)! = ??
0! = 1
(-3)! = undefined
4.1 Recognition of Permutation and Combination
A. Permutation
It is defined that
n
P
0
= 1 and 0! = 1. Then
. 0 where , ) 1 )...( 2 )( 1 ( n r r n n n n P
n
r
s < + =
)! (
!
1 2 3 )... 1 )( (
1 2 3 )... 1 )( )( 1 )...( 2 )( 1 (
r n
n
P
r n r n
r n r n r n n n n
P
n
r
n
r

=

+
=
!
) 1 )...( 2 )( 1 ( and
n P
n n n n n P
n n
n n
=
+ =
4.1 Recognition of Permutation and Combination
B. Combination
The different groups, each containing the same
number of objects, which can be formed by
taking r objects from a given collection of n
different objects, without reference to their order
of arrangement, are called the combination of
the n different objects taken r a time.
e.g. abc, acb, bac, bca, cab, cba
6 permutations but 1 combination
4.1 Recognition of Permutation and Combination
B. Combination
The symbols
n
C
r
or
n
C
r
or C
n
r
or C(n, r) are
usually used to denote the number of different
combinations of n different things taken r at a time.
)! ( !
!
, !
r n r
n
C
then P r C
r n
r n r n

=
=
, ! 4 . .
4 14 4 14
P C g e =
n
C
r =
)! ( !
!
r n r
n

5
C
2 =
)! 2 5 ( ! 2
! 5

10
) 1 2 3 ( ) 1 2 (
1 2 3 4 5
=


5
C
2 =
5
C
2 =
)! 3 ( ! 2
! 5
4.1 Recognition of Permutation and Combination
B. Combination
It is defined that
n
C
0
= 1. Then
1
0
= = C C
n n n
1001 . .
and
10 14 4 14
= =
=

C C g e
C C
r n n r n
3003 . .
and
5 15 5 14 4 14
1 1 1
= = +
= +
+ + +
C C C g e
C C C
r n r n r n
P.111 Ex. 4A
4.2 Proof of Binomial Theorem for Positive Integral Index
An algebraic expression containing
exactly two terms is a binomial.
The Binomial Theorem (Binomial expansion)
(a + b)
1
= 1a +1b
(a + b)
2
= (a + b)(a + b)
=1a
2
+ 2ab + 1b
2
(a + b)
3
= (a + b)(a + b)(a + b)
=1a
3
+ 3a
2
b +3ab
2
+1b
3
coefficient
4.2 Proof of Binomial Theorem for Positive Integral Index
Take out the coefficients of each expansion.
(a + b)
4
= (a + b)(a + b)(a + b)(a +b)
=1a
4
+ 4a
3
b +6a
2
b
2
+4ab
3
+1b
4
1
1 1
1 1
1 1
1 1
2
6
3 3
4 4
4.2 Proof of Binomial Theorem for Positive Integral Index
4.2 Proof of Binomial Theorem for Positive Integral Index
a Persian mathematician, 1261-75
Can you guess the expansion of (a + b)
5

without timing out the factors ?
(a + b)
5
=1a
5
+ 5a
4
b +10a
3
b
2
+10a
2
b
3
+5ab
4
+1b
4
+ + + +
4.2 Proof of Binomial Theorem for Positive Integral Index
Coefficients are arranged in a Pascal triangle.
Summation of the indices of each term is equal to
the power (order) of the expansion.
The first term of the expansion is arranged in
descending order after the expansion.
The second term of the expansion is arranged in
ascending order order after the expansion.
Number of terms in the expansion is equal to the
power of the expansion plus one.
Points to be noticed :
4.2 Proof of Binomial Theorem for Positive Integral Index
(a + b)
5
=1a
5
+ 5a
4
b +10a
3
b
2
+10a
2
b
3
+5ab
4
+1b
4
(a + b)
5
=1a
5
+
5
C
1
a
4
b +
5
C
2
a
3
b
2
+
5
C
3
a
2
b
3
+
5
C
4
ab
4
+
5
C
5
b
4
(a + b)
n
=1a
n
+
n
C
1
a
n-1
b +
n
C
2
a
n-2
b
2

+
n
C
3
a
n-3
b
3
+.+
n
C
r
a
n-r
b
r
+.+1b
n
where n is a positive integer
4.2 Proof of Binomial Theorem for Positive Integral Index
4.2 Proof of Binomial Theorem for Positive Integral Index
general term

in the expansion =
n
C
r
a
n-r
b
r
(r + 1)
th
term
4.2 Proof of Binomial Theorem for Positive Integral Index
4.2 Proof of Binomial Theorem for Positive Integral Index
(a + b)
n
= 1a
n
+
n
C
1
a
n-1
b +
n
C
2
a
n-2
b
2

+
n
C
3
a
n-3
b
3
+.+
n
C
r
a
n-r
b
r
+.+1b
n

= +
n
r
r r n
r n
n
b a C b a
0
) (
Standard form of the binomial theorem.
4.2 Proof of Binomial Theorem for Positive Integral Index

(~1350A.D.)
4.2 Proof of Binomial Theorem for Positive Integral Index
4.3 Properties of the Binomial Expansion
(1) The expansion contains (n + 1) terms.
(2) The (r + 1)th term of the expansion (a + b)
n

written in descending powers of a is
n
C
r
a
n-r
b
r
,
which is called the general term..
(3) The (r + 1)th term of the expansion (1 + x)
n

written in ascending powers of x is
n
C
r
x
r
, which is
the general term of the expansion..
(4) The binomial coefficients C
r
=
n
C
r
are all
integers, from the theory of combination.
4.3 Properties of the Binomial Expansion
(5) The coefficients of the terms equidistant
from the beginning and the end of the expansion
are equal, for C
0
= C
n
, C
1
= C
n-1
= n,,C
r
= C
n-r
=

.
This property might have been anticipated from
the fact that (a + b)
n
= (b + a)
n
.
)! ( !
!
r n r
n

4.3 Properties of the Binomial Expansion

General Binomial Theorem
If and n is a rational number, then
1 1 < < x
..
! 3
) 2 )( 1 (
! 2
) 1 (
1 ) 1 (
3 2
+

+

+ + = + x
n n n
x
n n
nx x
n
...
!
) 1 )...( 1 (
+
+
+
r
x
r
r n n n
4.3 Properties of the Binomial Expansion
(5) The coefficients of the terms equidistant
from the beginning and the end of the expansion
are equal, for C
0
= C
n
, C
1
= C
n-1
= n,,C
r
= C
n-r
=

.
This property might have been anticipated from
the fact that (a + b)
n
= (b + a)
n
.
)! ( !
!
r n r
n

P.116 Ex.4B
4.4 Alternative Notation for the Binomial Coefficients
Let n be any real number and r be any positive
integer, we define
( ) and
!
) 1 )...( 2 )( 1 (
r
r n n n n
n
r
+
=
( ) 1
0
=
n
e.g.
16
1
! 3
2
2
1
1
2
1
2
1
2
1
3
=
|
.
|

\
|

|
.
|

\
|

=
|
|
.
|

\
|
4.5 Properties of Binomial Coefficients
) 1 ........( ) 1 (
of expansion binomial The
0

=
= +
n
r
r
r n
n
x C x

=
=
=
n
r
n
r n
C
x A
0
2
obtain we ), 1 ( in 1 putting By ) (
i.e. then sum of the coefficients is 2
n
.
4.5 Properties of Binomial Coefficients
...) ( ...) ( 0
) 1 ( ... 0
obtain we ), 1 ( in 1 putting By ) (
5 3 1 4 2 0
3 2 1 0
+ + + + + + =
+ + + =
=
C C C C C C
C C C C C
x B
n n n n n n
n n
n
n n n n
...) ( ...) (
5 3 1 4 2 0
+ + + = + + + C C C C C C
n n n n n n
From (A)
n
n n n n n n
C C C C C C 2 ...) ( ...) (
5 3 1 4 2 0
= + + + + + + +
1
5 3 1 4 2 0
2 ...) ( ...) (

= + + + = + + +
n
n n n n n n
C C C C C C
i.e. the sum of the even coefficients is equal to
the sum of the odd coefficients , each being equal
to 2
n-1
.
4.5 Properties of Binomial Coefficients
4.5 Properties of Binomial Coefficients
4.5 Properties of Binomial Coefficients
4.5 Properties of Binomial Coefficients
4.5 Properties of Binomial Coefficients
4.5 Properties of Binomial Coefficients
4.5 Properties of Binomial Coefficients
4.5 Properties of Binomial Coefficients
4.5 Properties of Binomial Coefficients
4.5 Properties of Binomial Coefficients
4.5 Properties of Binomial Coefficients
4.5 Properties of Binomial Coefficients
4.5 Properties of Binomial Coefficients
4.5 Properties of Binomial Coefficients
4.5 Properties of Binomial Coefficients
4.5 Properties of Binomial Coefficients
4.5 Properties of Binomial Coefficients
4.5 Properties of Binomial Coefficients
4.5 Properties of Binomial Coefficients
P.124 Ex.4C
P.126 Ex.4D