Binomial Theorem and Pascal's Triangle

The Binomial Theorem gives a closed-form expansion of $(x + y)^{n}$ as a sum of terms $(k n) x^{n - k} y^{k}$ , where the coefficients $(k n)$ are exactly the numbers in Pascal's Triangle. It converts a messy repeated multiplication into a predictable, countable pattern. Used throughout algebra, combinatorics, probability, and calculus. Known in fragments to ancient Indian, Persian, and Chinese mathematicians; formalized by Newton in the 17th century.

The Binomial Theorem states that for any non-negative integer $n$ , the power $(x + y)^{n}$ expands into a sum of $n + 1$ terms whose coefficients follow a fixed combinatorial rule. These coefficients, the binomial coefficients $(k n)$ , count the number of ways to choose $k$ objects from $n$ , and arranging them in rows produces the self-replicating numerical lattice called Pascal's Triangle. The theorem matters because it unifies algebra (expanding powers), combinatorics (counting subsets), and probability (the binomial distribution) under a single formula. A surprising fact: the sum of every row of Pascal's Triangle is a power of two, and its diagonals secretly encode the triangular numbers, the tetrahedral numbers, and even the Fibonacci sequence.

The Core Insight

When you expand $(x + y)^{n} = n factors (x + y) (x + y) \dots (x + y)$ , each term in the result is built by choosing either $x$ or $y$ from each of the $n$ factors. A term with exactly $k$ copies of $y$ (and $n - k$ copies of $x$ ) can be formed in $(k n)$ different ways — one for each choice of which $k$ factors contributed the $y$ . Counting these choices is the expansion. The algebra of multiplying binomials and the combinatorics of choosing subsets are the same activity.

Formal Statement

Binomial Coefficient

The binomial coefficient $(k n)$ (read " $n$ choose $k$ ") is the number of ways to select $k$ objects from a set of $n$ distinct objects without regard to order. For integers $0 \leq k \leq n$ :

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

⟳there are

n! / (n - k)!

ordered ways to pick

k

items, then divide by

k!

to discard the orderings of the chosen set.

Here $n! = n \cdot (n - 1) \dots 2 \cdot 1$ is the factorial, with the convention $0! = 1$ . By convention $(k n) = 0$ when $k < 0$ or $k > n$ .

The Binomial Theorem

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

(x + y)^{n} = k = 0 \sum n (k n) x^{n - k} y^{k}

⟳expand the product of

n

identical factors and collect terms by how many factors contributed

y

; each such term appears

(k n)

times.

Written out, this is:

(x + y)^{n} = (0 n) x^{n} + (1 n) x^{n - 1} y + (2 n) x^{n - 2} y^{2} + \dots + (n n) y^{n}

⟳substitute

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

into equation [2] term by term.

The symbols mean: $n$ is the power (a fixed non-negative integer); $k$ is the summation index running from $0$ to $n$ ; $(k n)$ is the coefficient of the term in which $y$ appears to the $k$ -th power; the exponents of $x$ and $y$ in every term sum to $n$ .

Pascal's Rule

The binomial coefficients satisfy the recurrence that generates Pascal's Triangle:

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

⟳to choose

k

from

n

objects, either include a fixed special object (then choose

k - 1

from the remaining

n - 1

) or exclude it (then choose

k

from

n - 1

); these cases are disjoint and exhaustive.

Each entry is the sum of the two entries diagonally above it. With boundary values $(0 n) = (n n) = 1$ , this rule constructs the entire triangle.

Why It Holds / Derivation

Combinatorial Proof of the Binomial Theorem

We prove equation [2] by directly analyzing the product.

Step 1. Write the power as a product of

n

identical factors:

(x + y)^{n} = n factors (x + y) (x + y) \dots (x + y)

⟳this is just the definition of raising to the

n

-th power.

Step 2. When this product is fully expanded (using the distributive law repeatedly), each resulting term is formed by choosing exactly one of

x

y

from each of the

n

factors and multiplying the choices together. Step 3. Any individual term that contains

y

exactly

k

times must contain

x

exactly

n - k

times, giving the monomial

x^{n - k} y^{k}

. Step 4. The number of distinct terms equal to

x^{n - k} y^{k}

equals the number of ways to choose which

k

of the

n

factors supplied the

y

. By the definition of the binomial coefficient, this count is

(k n)

. Step 5. Summing over all possible values

k = 0, 1, \dots, n

collects every term:

(x + y)^{n} = k = 0 \sum n (k n) x^{n - k} y^{k}

⟳each monomial

x^{n - k} y^{k}

occurs

(k n)

times, so its total coefficient is

(k n)

This completes the proof. $■$

Inductive Proof Using Pascal's Rule

Base case. For

n = 0

(x + y)^{0} = 1 = (0 0) x^{0} y^{0}

. The formula holds. Inductive step. Assume equation [2] holds for

n - 1

. Then:

(x + y)^{n} = (x + y) k = 0 \sum n - 1 (k n - 1) x^{n - 1 - k} y^{k}

⟳multiply the assumed expansion for

(x + y)^{n - 1}

by one more factor of

(x + y)

Distributing and re-indexing the two resulting sums, the coefficient of $x^{n - k} y^{k}$ becomes $(k - 1 n - 1) + (k n - 1)$ , which equals $(k n)$ by Pascal's Rule [4]. The formula therefore holds for $n$ , completing the induction. $■$

Blaise Pascal | 1623–1662

Though the triangle bears his name, Pascal was far from its discoverer — it appears centuries earlier in India, Persia, and China. His enduring contribution was his 1654 Traité du triangle arithmétique, the first systematic treatment that derived the triangle's many identities and, crucially, used it to launch (with Pierre de Fermat) the mathematical theory of probability. Pascal was a child prodigy who built a mechanical calculator at nineteen, made foundational contributions to fluid mechanics and projective geometry, and later abandoned mathematics for theology. His name on the triangle is a reminder that history rewards systematization, not just first sighting.

Building Intuition

Think of expanding $(x + y)^{n}$ as filling $n$ boxes in a row, each box holding either an $x$ or a $y$ . The whole expansion lists all possible fillings. Terms with the same number of $y$ 's collapse into one because multiplication doesn't care about order — and the number that collapse together is exactly "how many ways to place $k$ y's among $n$ boxes," which is $(k n)$ .

Pascal's Triangle is the bookkeeping device for this. Row $n$ lists the coefficients for $(x + y)^{n}$ . Each interior number being the sum of the two above it mirrors a real choice: a path reaching a position either came from the upper-left or the upper-right, and the count of paths to that spot is the sum of the counts to its two predecessors. The triangle is, quite literally, a map of how many routes lead to each outcome.

Pascal's Triangle: each entry is the sum of the two above it; row n gives the coefficients of (x+y)^n

Worked Examples

Expanding a Fourth Power

Given: Expand

(2 a + 3)^{4}

completely. Step 1. Identify

x = 2 a

y = 3

n = 4

. Row 4 of Pascal's Triangle is

1, 4, 6, 4, 1

. Step 2. Apply equation [3]:

(2 a + 3)^{4} = k = 0 \sum 4 (k 4) (2 a)^{4 - k} (3)^{k}

⟳substitute the known coefficients and powers term by term.

Step 3. Compute each term:

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

Step 4. Sum the terms.

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

Extracting a Single Coefficient

Given: Find the coefficient of

x^{5}

in the expansion of

(x - 2)^{8}

. Step 1. The general term is

(k 8) x^{8 - k} (- 2)^{k}

. We need the exponent of

x

to be

5

, so

8 - k = 5

, giving

k = 3

. Step 2. Compute the binomial coefficient using equation [1]:

(3 8) = \frac{8 !}{3 ! 5 !} = \frac{8 \cdot 7 \cdot 6}{3 \cdot 2 \cdot 1} = 56

⟳cancel the common

5!

factor and evaluate the remaining product.

Step 3. Include the

(- 2)^{k}

factor:

(- 2)^{3} = - 8

. Step 4. Multiply: coefficient

= 56 \cdot (- 8) = - 448

coefficient of x^{5} = - 448

Note the alternating sign comes from the negative $y = - 2$ term.

Common Misconceptions

The exponent does not distribute. A persistent error is writing

(x + y)^{n} = x^{n} + y^{n}

. This is false for every

n \geq 2

. For instance

(x + y)^{2} = x^{2} + 2 x y + y^{2}

, not

x^{2} + y^{2}

— the middle "cross terms" are precisely what the binomial coefficients account for. Track the signs. When expanding

(x - y)^{n}

, treat the second term as

+ (- y)

. The signs alternate:

(k n) (- y)^{k} = (- 1)^{k} (k n) y^{k}

. Forgetting this gives wrong signs on the odd-power terms. Exponents must sum to $n$ . In every term of

(x + y)^{n}

, the powers of

x

and

y

add to exactly

n

. If your exponents don't sum to

n

, you have an arithmetic error.

Consider the claim " $(a + b)^{3} = a^{3} + b^{3}$ ." Test with $a = 1, b = 1$ :

(1 + 1)^{3} = 2^{3} = 8, but 1^{3} + 1^{3} = 2

⟳evaluate both sides numerically with the smallest nontrivial values.

Since $8 \neq = 2$ , the claim is false. The correct expansion $(a + b)^{3} = a^{3} + 3 a^{2} b + 3 a b^{2} + b^{3}$ gives $1 + 3 + 3 + 1 = 8$ ✓. The "missing" $6$ is exactly the contribution of the cross terms $3 a^{2} b + 3 a b^{2}$ .

Connections

The Binomial Theorem sits at the crossroads of several fields. Its coefficients $(k n)$ are the central objects of Combinatorics, where they count subsets, lattice paths, and committee selections. Substituting $x = y = 1$ into equation [2] yields $\sum_{k} (k n) = 2^{n}$ , a foundational identity linking it to the Power Set (a set of $n$ elements has $2^{n}$ subsets). In Probability Theory, the Binomial Distribution uses these very coefficients to count the ways an event can occur $k$ times in $n$ trials. The theorem also generalizes: Newton's Generalized Binomial Series extends it to non-integer and negative exponents, producing the infinite series that underpin much of Calculus. Finally, the diagonals of Pascal's Triangle reproduce the Triangular Numbers and, read along shallow diagonals, the Fibonacci Sequence.

Real-World Applications

Probability and statistics — The binomial distribution $P (k) = (k n) p^{k} (1 - p)^{n - k}$ models coin flips, quality-control defect rates, election polling, and clinical-trial outcomes; the coefficients come directly from the theorem.
Genetics (Punnett squares) — Predicting the distribution of offspring genotypes across generations uses binomial coefficients to count gene-combination outcomes.
Compound interest and finance — The binomial options-pricing model (Cox–Ross–Rubinstein) prices financial derivatives by summing over $(k n)$ up-and-down price paths in a binomial tree.
Computer science — Algorithm analysis counts combinations (e.g., the number of subsets, hash collisions, or comparisons) using binomial coefficients; the triangle appears in dynamic-programming tables.
Error-correcting codes — The number of codewords at a given Hamming distance is a binomial coefficient, central to designing reliable digital communication.
Physics — Galton board — A bead bouncing through $n$ rows of pegs lands in bin $k$ with probability $(k n) / 2^{n}$ , physically demonstrating both the triangle and the approach to the normal curve.
Engineering — Bézier curves — Computer graphics and CAD use Bernstein polynomials $(k n) t^{k} (1 - t)^{n - k}$ , built from binomial coefficients, to define smooth design curves.

Historical Development

c. 200 BCE — Indian scholar Pingala describes the Meru Prastāra ("Mount Meru staircase"), an early form of the triangle used for counting metrical patterns in Sanskrit prosody.
c. 950 CE — Indian mathematician Halayudha gives an explicit commentary describing the triangle's construction.
c. 1000 CE — Persian mathematician al-Karaji proves the binomial expansion for positive integer exponents and uses an early induction-like argument.
c. 1070 CE — Omar Khayyám references the triangle and binomial coefficients in connection with extracting roots.
1303 CE — Chinese mathematician Zhu Shijie publishes the Jade Mirror of the Four Unknowns, depicting the triangle (now called Yang Hui's triangle in China after the earlier Yang Hui, c. 1261).
1527 CE — Petrus Apianus prints the triangle on the title page of a European arithmetic book, its first Western publication.
1654 CE — Blaise Pascal writes the Traité du triangle arithmétique, systematically deriving its identities and applying it to probability with Fermat.
1665 CE — Isaac Newton generalizes the theorem to fractional and negative exponents, producing the infinite binomial series, a key step toward calculus.
1730s onward — The theorem becomes a standard tool in analysis and probability; later, De Moivre and Laplace show the binomial distribution approaches the normal curve.

Subtleties & Limits

The clean finite formula [2] holds only for non-negative integer $n$ . Newton's generalization

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

⟳define the generalized binomial coefficient via the falling product, which terminates only when

α

is a non-negative integer.

becomes an infinite series when $α$ is not a non-negative integer, and it only converges for $∣ x ∣ < 1$ . Questions of convergence, valid domains, and extension to complex exponents move the topic into real and complex analysis. A further deep generalization, the multinomial theorem, expands $(x_{1} + x_{2} + \dots + x_{m})^{n}$ using multinomial coefficients $(k _{1} , \dots , k _{m} n)$ — these populate higher-dimensional analogues of Pascal's Triangle (Pascal's pyramid and beyond), whose combinatorial structure is still a fertile area of study.