Binomial Theorem

The Binomial Theorem gives a formula for expanding $(a + b)^{n}$ as a sum of terms involving binomial coefficients. Key result: $(a + b)^{n} = \sum_{k = 0}^{n} (k n) a^{n - k} b^{k}$ . Where it applies: algebra, combinatorics, probability, calculus approximations. Who/when: known in fragments to ancient mathematicians; generalized by Isaac Newton (1665) to non-integer exponents.

The Binomial Theorem expresses any non-negative integer power of a two-term sum $(a + b)^{n}$ as a finite sum of terms of the form $(k n) a^{n - k} b^{k}$ , where the coefficients $(k n)$ are the binomial coefficients. It matters because it converts a repeated multiplication that would otherwise require tedious expansion into a single, predictable pattern — and because those same coefficients count combinations, linking algebra directly to counting. The theorem connects Pascal's Triangle, Combinations and Permutations, and the expansion of polynomials into one unified structure. A surprising fact: Newton extended the formula to fractional and negative exponents, producing an infinite series that converges for $∣ b / a ∣ < 1$ — turning a finite algebraic identity into a powerful tool of analysis.

The Core Insight

When you multiply out $(a + b)^{n} = (a + b) (a + b) \dots (a + b)$ , each term of the result is built by choosing either $a$ or $b$ from each of the $n$ factors. A term with exactly $k$ copies of $b$ (and $n - k$ copies of $a$ ) arises in as many ways as you can choose which $k$ factors contribute the $b$ — that is, $(k n)$ ways. So the coefficient of $a^{n - k} b^{k}$ is precisely the number of combinations $(k n)$ .

Formal Statement

Binomial Coefficient

The binomial coefficient $(k n)$ (read " $n$ choose $k$ ") counts the number of ways to choose $k$ objects from $n$ distinct objects without regard to order:

(k n) = \frac{n !}{k ! ( n - k )!}, 0 \leq k \leq n

⟳count ordered selections

n! / (n - k)!

, then divide by

k!

to remove the ordering among the chosen items.

Here $n!$ (" $n$ factorial") denotes $n! = n \cdot (n - 1) \dots 2 \cdot 1$ , with the convention $0! = 1$ . The symbol $k$ is the index, ranging over the integers from $0$ to $n$ .

Binomial Theorem (Integer Exponent)

For any real (or complex) numbers $a, b$ and any non-negative integer $n$ :

(a + b)^{n} = k = 0 \sum n (k n) a^{n - k} b^{k}

⟳expand the product of

n

identical factors and collect the terms in which

b

is chosen

k

times.

Written out, this reads:

(a + b)^{n} = (0 n) a^{n} + (1 n) a^{n - 1} b + (2 n) a^{n - 2} b^{2} + \dots + (n n) b^{n}

⟳substitute

k = 0, 1, 2, \dots, n

into equation [2] term by term.

Each symbol: $a, b$ are the two terms of the binomial; $n$ is the (non-negative integer) exponent; $k$ indexes the terms; $(k n)$ is the coefficient. There are exactly $n + 1$ terms.

General (Newton's) Binomial Series

For any real exponent $α$ and $∣ x ∣ < 1$ :

(1 + x)^{α} = k = 0 \sum \infty (k α) x^{k}, (k α) = \frac{α ( α - 1 ) \dots ( α - k + 1 )}{k !}

⟳take the Taylor series of

(1 + x)^{α}

about

x = 0

; the

k

-th derivative at

0

yields the generalized coefficient.

When $α$ is a non-negative integer, the series terminates and reduces to equation [2]. Otherwise it is an infinite series.

Why It Holds / Derivation

Combinatorial Proof of the Binomial Theorem

We prove equation [2] by counting.

Step 1. Write the power as an explicit product of

n

identical factors:

(a + b)^{n} = n factors (a + b) (a + b) \dots (a + b)

⟳a power with integer exponent is repeated multiplication by definition.

Step 2. Expanding fully (by the distributive law), every term in the result is a product of one chosen letter — either

a

b

— from each of the

n

factors. Each such term therefore has the form

a^{n - k} b^{k}

for some

k

between

0

and

n

. Step 3. A term equals

a^{n - k} b^{k}

precisely when we picked

b

from exactly

k

of the factors and

a

from the remaining

n - k

. The number of ways to choose which

k

factors supply the

b

(k n)

. Step 4. Collecting all identical terms, the coefficient of

a^{n - k} b^{k}

(k n)

. Summing over all valid

k

(a + b)^{n} = k = 0 \sum n (k n) a^{n - k} b^{k}

⟳group the

2^{n}

raw terms by how many

b

's each contains.

■

Inductive Proof Using Pascal's Rule

An alternative proof uses induction on $n$ and the identity $(k n) + (k - 1 n) = (k n + 1)$ (Pascal's Rule).

Step 1 (Base case). For

n = 0

(a + b)^{0} = 1 = (0 0) a^{0} b^{0}

. ✓ Step 2 (Inductive step). Assume equation [2] holds for

n

. Multiply both sides by

(a + b)

(a + b)^{n + 1} = (a + b) k = 0 \sum n (k n) a^{n - k} b^{k}

⟳distribute

(a + b)

across the assumed expansion.

Step 3. Distribute and shift indices so the powers of

b

align:

(a + b)^{n + 1} = k = 0 \sum n + 1 [(k n) + (k - 1 n)] a^{n + 1 - k} b^{k}

⟳collect the coefficient of

a^{n + 1 - k} b^{k}

from the two products, treating

(- 1 n) = (n + 1 n) = 0

Step 4. Apply Pascal's Rule

(k n) + (k - 1 n) = (k n + 1)

(a + b)^{n + 1} = k = 0 \sum n + 1 (k n + 1) a^{n + 1 - k} b^{k}

⟳substitute Pascal's identity into equation [8].

This is exactly equation [2] with $n$ replaced by $n + 1$ , completing the induction. $■$

Isaac Newton | 1643–1727

Although special cases of the binomial expansion were known centuries earlier, Isaac Newton made the decisive leap around 1665, while plague closed Cambridge. Reasoning by analogy and pattern, he proposed that the binomial formula should hold even when the exponent is fractional or negative — yielding an infinite series (equation [4]). He used this to compute square roots, expand $(1 - x^{2})^{1/2}$ for areas under curves, and develop the foundations of calculus. He never published a rigorous proof; convergence was established rigorously only much later. The generalized binomial series remains one of his most fertile discoveries, feeding directly into power series and analysis.

Building Intuition

Think of expanding $(a + b)^{3} = (a + b) (a + b) (a + b)$ as walking through three "doors," at each of which you grab either an $a$ or a $b$ . There are $2^{3} = 8$ possible walks, each giving a product of three letters. How many walks give exactly two $b$ 's? You must choose which $2$ of the $3$ doors give $b$ : that's $(2 3) = 3$ walks, so the coefficient of $a b^{2}$ is $3$ . This is why coefficients are counts. The symmetry $(k n) = (n - k n)$ reflects the fact that choosing where the $b$ 's go is the same as choosing where the $a$ 's go — which is why expansions read the same forwards and backwards: $1, 3, 3, 1$ .

Pascal's Triangle generating the binomial coefficients; each entry is the sum of the two above it

Worked Examples

Expanding a Power Directly

Given: Expand

(2 x + 3)^{4}

. Step 1. Use equation [2] with

a = 2 x

b = 3

n = 4

. The coefficients (row

n = 4

of Pascal's Triangle) are

1, 4, 6, 4, 1

. Step 2. Write each term

(k 4) (2 x)^{4 - k} (3)^{k}

$k = 0$ : $1 \cdot (2 x)^{4} \cdot 1 = 16 x^{4}$
$k = 1$ : $4 \cdot (2 x)^{3} \cdot 3 = 4 \cdot 8 x^{3} \cdot 3 = 96 x^{3}$
$k = 2$ : $6 \cdot (2 x)^{2} \cdot 9 = 6 \cdot 4 x^{2} \cdot 9 = 216 x^{2}$
$k = 3$ : $4 \cdot (2 x) \cdot 27 = 216 x$
$k = 4$ : $1 \cdot 1 \cdot 81 = 81$

Step 3. Sum the terms.

(2 x + 3)^{4} = 16 x^{4} + 96 x^{3} + 216 x^{2} + 216 x + 81

Finding a Single Term Without Full Expansion

Given: Find the coefficient of

x^{5}

in the expansion of

(x^{2} + \frac{2}{x})^{7}

. Step 1. The general term is

(k 7) (x^{2})^{7 - k} (\frac{2}{x})^{k} = (k 7) 2^{k} x^{2 (7 - k) - k}

. Step 2. The power of

x

14 - 2 k - k = 14 - 3 k

. Set this equal to

5

14 - 3 k = 5 ⟹ 3 k = 9 ⟹ k = 3.

Step 3. Substitute

k = 3

: coefficient

= (3 7) 2^{3} = 35 \cdot 8 = 280

Coefficient of x^{5} = 280

Common Misconceptions

$(a + b)^{n} \neq = a^{n} + b^{n}$ . This is the single most common error. The "middle terms" do not vanish. For example,

(a + b)^{2} = a^{2} + 2 ab + b^{2}

, not

a^{2} + b^{2}

— the

2 ab

term is real and often the most important. Squaring (or raising to any power

\geq 2

) is not distributive over addition. The binomial coefficient is not $n / k$ or $n^{k}$ . Always use

(k n) = \frac{n !}{k ! ( n - k )!}

. Also remember

(0 n) = (n n) = 1

, never

0

A student claims $(3 + 4)^{2} = 3^{2} + 4^{2} = 9 + 16 = 25$ . But $(3 + 4)^{2} = 7^{2} = 49$ . The discrepancy of $24$ is exactly the missing middle term $2 ab = 2 \cdot 3 \cdot 4 = 24$ . The "freshman's dream" $(a + b)^{n} = a^{n} + b^{n}$ holds only in special structures (e.g. modular arithmetic where $n$ is a prime $p$ , giving $(a + b)^{p} \equiv a^{p} + b^{p} (mod p)$ ) — never in ordinary real arithmetic for $n \geq 2$ .

Connections

The Binomial Theorem sits at a crossroads of algebra and combinatorics. Its coefficients are the Combinations and Permutations counts $(k n)$ , and they are arranged geometrically in Pascal's Triangle. Setting $a = b = 1$ in equation [2] gives $\sum_{k} (k n) = 2^{n}$ , the number of subsets of an $n$ -set, linking it to Set Theory. In probability, the Binomial Distribution $P (X = k) = (k n) p^{k} (1 - p)^{n - k}$ is literally a term of the expansion of $(p + (1 - p))^{n}$ . Newton's general series (equation [4]) is a special case of the Taylor Series, grounding the theorem in calculus and Power Series.

Real-World Applications

Probability (Binomial Distribution): Computing the chance of exactly $k$ successes in $n$ independent trials — coin flips, quality-control defects, clinical-trial outcomes — uses $(k n) p^{k} q^{n - k}$ directly.
Compound interest & finance: Expanding $(1 + r)^{n}$ and its general-exponent form approximates growth and bond pricing; the linear term $n r$ gives the simple-interest estimate.
Numerical approximation: For small $x$ , $(1 + x)^{1/2} \approx 1 + \frac{1}{2} x - \frac{1}{8} x^{2}$ (from equation [4]) lets engineers compute square roots and relativistic corrections quickly.
Special relativity: The Lorentz factor $γ = (1 - v^{2} / c^{2})^{- 1/2}$ is expanded via the binomial series to recover $\frac{1}{2} m v^{2}$ as the low-speed limit of kinetic energy.
Computer science & algorithms: Counting subsets, paths in a grid, and analyzing combinatorial complexity all rely on binomial coefficients.
Genetics: Predicting offspring genotype ratios (e.g., Punnett-square frequencies across multiple loci) uses binomial expansion of $(p + q)^{n}$ .
Calculus foundations: The power rule $\frac{d}{d x} x^{n} = n x^{n - 1}$ can be derived from the limit of $\frac{( x + h ) ^{n} - x ^{n}}{h}$ , whose leading term comes from the binomial expansion.

Historical Development

c. 300 BCE — Euclid: Records the case $n = 2$ , $(a + b)^{2} = a^{2} + 2 ab + b^{2}$ , geometrically as areas of squares and rectangles.
c. 200 BCE — Pingala (India): Studies combinatorial structures (the Meru Prastara) that anticipate Pascal's Triangle in the context of prosody.
c. 1000 CE — Al-Karaji & Al-Samaw'al (Persia): Give the triangular arrangement of coefficients and an early inductive argument for the integer binomial expansion.
c. 1100 CE — Omar Khayyám: References a method for finding roots using binomial coefficients, knowing the triangle for higher powers.
1303 — Zhu Shijie (China): Publishes the Jade Mirror of the Four Unknowns, depicting the coefficient triangle up to the eighth power.
1654 — Blaise Pascal: Writes the Traité du triangle arithmétique, systematizing the triangle and its properties; the array later bears his name.
1665 — Isaac Newton: Generalizes to fractional and negative exponents, producing the infinite binomial series (equation [4]).
1676 — Newton's letters: He communicates the general theorem to Leibniz via the Epistola prior, spreading it through Europe.
19th century — Abel & Cauchy: Establish rigorous convergence conditions for the binomial series, completing Newton's heuristic work.

Subtleties & Limits

The finite Binomial Theorem (equation [2]) is fully settled and exact. The generalized series (equation [4]) raises genuine subtleties: it converges only for $∣ x ∣ < 1$ , and behavior at the boundary $∣ x ∣ = 1$ depends delicately on $α$ (governed by results like Abel's theorem and the Gauss test). Extending binomial-type expansions to multinomials $(a_{1} + \dots + a_{m})^{n}$ generalizes the coefficients to multinomial coefficients $\frac{n !}{k _{1} ! \dots k _{m} !}$ , and further to $q$ -analogues (Gaussian binomial coefficients) and noncommutative settings (where $ab \neq = ba$ breaks the simple formula — the $q$ -binomial theorem repairs it). Identifying combinatorial interpretations of identities among binomial coefficients (bijective proofs) remains an active area of enumerative combinatorics.