The Binomial Theorem

We know that

(x+y)0 = 1
(x+y)1 = x+y
(x+y)2 = x2+2xy+y2
and we can easily expand
(x+y)3 = x3+3x2y+3xy2+y3.

For higher powers, the expansion gets very tedious by hand! Fortunately, the Binomial Theorem gives us the expansion for any positive integer power of (x+y):


Binomial Theorem

For any positive integer n,

(x+y)n = n
Σ
k = 0 
/

\
n
k
\
 |
/
xn-kyk
where
/

\
n
k
\
 |
/
= (n)(n-1)(n-2)…(n-(k-1))
k!
= n!
k!(n-k)!
.


Proof by Induction     Combinatorial Proof     Connection to Pascal's Triangle

Example

By the Binomial Theorem,

(x+y)3 =
3
Σ
k = 0 
/

\
3
k
\
 |
/
x3-kyk
=
/

\
3
0
\
 |
/
x3+ /

\
3
1
\
 |
/
x2y+ /

\
3
2
\
 |
/
xy2+ /

\
3
3
\
 |
/
y3
= x3 + 3x2y + 3xy2 + y3
as expected.

Extensions of the Binomial Theorem

A useful special case of the Binomial Theorem is

(1+x)n = n
Σ
k = 0 
/

\
n
k
\
 |
/
xk
for any positive integer n, which is just the Taylor series for (1+x)n.

This formula can be extended to all real powers α:

(1+x)α =
Σ
k = 0 
/

\
α
k
\
 |
/
xk
for any real number α, where
/

\
α
k
\
 |
/
= (α)(α-1)(α-2)…(α-(k-1))
k!
= α!
k!(α-k)!
.

Notice that the formula now gives an infinite series. (When α = n is a positive integer, all but the first (n+1) terms are 0 since after this n-n ( = 0) appears in each numerator.)

This expansion is very useful for approximating (1+x)α for |x|| << 1:

(1+x)α = 1+αx+ α(α-1)
2!
x2+ α(α-1)(α-2)
3!
x3+… .

But for |x| << 1, higher powers of x get small very quickly, so (1+x)α can be approximated to any accuracy we need by truncating the series after a finite number of terms.

Example

For |x| << 1,

(1+x)5/2
1+ 5
2
x,
(1-2x)100 1-200x,
(1+x2)-3 1-3x2.

This type of reasoning is useful in investigating what happens when a physical system is perturbed slightly, introducing a new very small term x.



Key Concepts [index]

Binomial Theorem

For any positive integer n,

(x+y)n = n
Σ
k = 0 
/

\
n
k
\
 |
/
xn-kyk
where
/

\
n
k
\
 |
/
= (n)(n-1)(n-2)…(n-(k-1))
k!
= n!
k!(n-k)!
.