Binomial Theorem

The Binomial Theorem states that for real or complex $a$ , $b$ , and non-negative integer $n$ ,

$(a+b)^n = \sum_{k=0}^{n}\binom{n}{k}a^{n-k}b^k$

where $\binom{n}{k} = \frac{n!}{k!(n-k)!}$ is a binomial coefficient. This result has a nice combinatorial proof: $(a+b)^n=\underbrace{ (a+b)\cdot(a+b)\cdot(a+b)\cdot\cdots\cdot(a+b) }_{n}$ . Repeatedly using the distributive property, we see that for a term $a^m b^{n-m}$ , we must choose $m$ of the $n$ terms to contribute an $a$ to the term, and then each of the other $n-m$ terms of the product must contribute a $b$ . Thus, the coefficient of $a^m b^{n-m}$ is $\binom{m}{n}$ . Extending this to all possible values of $m$ from $0$ to $n$ , we see that $(a+b)^n = \sum_{k=0}^{n}{\binom{n}{k}}\cdot a^k\cdot b^{n-k}$ .

Generalizations

The Binomial Theorem was generalized by Isaac Newton, who used an infinite series to allow for complex exponents: For any real or complex $a$ , $b$ , and $r$ ,

$(a+b)^r = \sum_{k=0}^{\infty}\binom{r}{k}a^{r-k}b^k$ .

Proof

Consider the function $f(b)=(a+b)^r$ for constants $a,r$ . It is easy to see that $\frac{d^k}{db^k}f=r(r-1)\cdots(r-k+1)(a+b)^{r-k}$ . Then, we have $\frac{d^k}{db^k}f(0)=r(r-1)\cdots(r-k+1)a^{r-k}$ . So, the Taylor series for $f(b)$ centered at $0$ is

$(a+b)^k=\sum_{k=0}^\infty \frac{r(r-1)\cdots(r-k+1)a^{r-k}b^k}{k!}=\sum_{k=0}^\infty \binom{r}{k}a^{r-k}b^k.$

Usage

Many factorizations involve complicated polynomials with binomial coefficients. For example, if a contest problem involved the polynomial $x^5+4x^4+6x^3+4x^2+x$ , one could factor it as such: $x(x^4+4x^3+6x^2+4x+1)=x(x+1)^{4}$ . It is a good idea to be familiar with binomial expansions, including knowing the first few binomial coefficients.

Page

Toolbox

Search

Binomial Theorem

Contents

Generalizations

Proof

Usage

See also