Binomial Theorem and Pascal's Triangle

💡 The Core Insight

The coefficients in the expansion of $(a + b)^n$ count the number of ways to choose objects, revealing a deep connection between algebra and combinatorics. Each term represents all the ways to pick $a$ from some brackets and $b$ from the remaining ones.

Definition

Binomial Theorem and Pascal's Triangle: The binomial theorem states that for any real numbers $a$ and $b$ and any non-negative integer $n$ :

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

where the binomial coefficient $\binom{n}{k}$ (read " $n$ choose $k$ ") is defined as:

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

Pascal's triangle is the infinite triangular array where the entry in row $n$ and position $k$ (both counted from 0) equals $\binom{n}{k}$ . Each entry is the sum of the two entries directly above it, with 1's along the edges.

TheoremMain Result

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

(a + b)^n = \sum_{k=0}^{n} \binom{n}{k} a^{n-k} b^k = \binom{n}{0}a^n + \binom{n}{1}a^{n-1}b + \binom{n}{2}a^{n-2}b^2 + \cdots + \binom{n}{n}b^n \quad [1]

Theorem (Pascal's Identity): For any positive integers $n$ and $k$ with $1 \leq k \leq n$ ,

\binom{n}{k} = \binom{n-1}{k-1} + \binom{n-1}{k} \quad [2]

Theorem (Symmetry of Binomial Coefficients): For $0 \leq k \leq n$ ,

\binom{n}{k} = \binom{n}{n-k} \quad [3]

Proof

Proof of the Binomial Theorem by Combinatorial Argument: When we expand $(a + b)^n$ , we're multiplying $n$ copies of the binomial: $(a + b)(a + b)(a + b)\cdots(a + b)$ . To create a term in the expansion, we must choose either $a$ or $b$ from each of the $n$ factors and multiply these choices together. Consider a term of the form $a^{n-k}b^k$ . This term arises whenever we select $a$ from exactly $(n-k)$ of the factors and $b$ from the remaining $k$ factors. The question becomes: in how many ways can we make such a selection? This is precisely asking: in how many ways can we choose $k$ positions (from $n$ total positions) to contribute the factor $b$ ? This is a combination problem, and the answer is $\binom{n}{k}$ . Since each selection pattern gives us the same term $a^{n-k}b^k$ , and there are $\binom{n}{k}$ such patterns, the coefficient of $a^{n-k}b^k$ must be $\binom{n}{k}$ . Summing over all possible values of $k$ from 0 to $n$ gives us the complete expansion. □

Proof of Pascal's Identity: We prove this combinatorially. The left side $\binom{n}{k}$ counts the number of ways to choose $k$ objects from a set of $n$ objects. Label one particular object as "special." Any $k$ -subset either contains this special object or it doesn't.

If the $k$ -subset contains the special object, we need to choose the remaining $k-1$ objects from the other $n-1$ objects. This can be done in $\binom{n-1}{k-1}$ ways.

If the $k$ -subset does not contain the special object, we must choose all $k$ objects from the remaining $n-1$ objects. This can be done in $\binom{n-1}{k}$ ways.

Since these cases are mutually exclusive and exhaustive, $\binom{n}{k} = \binom{n-1}{k-1} + \binom{n-1}{k}$ . □

∎

⚠️ Common mistake

A common error is to think that $(a + b)^n = a^n + b^n$ . This is false for $n \geq 2$ ! For example, $(a + b)^2 = a^2 + 2ab + b^2 \neq a^2 + b^2$ . The middle terms with mixed powers are crucial. Another mistake is forgetting that the binomial theorem as stated applies to non-negative integer exponents; extending to negative or fractional exponents requires infinite series and careful attention to convergence.

mathematician

Blaise Pascal (1653) — Though Pascal's triangle was known earlier in other cultures, Pascal systematically developed its properties in his Traité du triangle arithmétique, establishing the foundation for modern probability theory.

visualization

Example1

Expanding $(x + 2)^4$ Using the binomial theorem with $a = x$ , $b = 2$ , and $n = 4$ :

(x + 2)^4 = \sum_{k=0}^{4} \binom{4}{k} x^{4-k} \cdot 2^k

Let's compute each term:

$k = 0$ : $\binom{4}{0}x^4 \cdot 2^0 = 1 \cdot x^4 \cdot 1 = x^4$
$k = 1$ : $\binom{4}{1}x^3 \cdot 2^1 = 4 \cdot x^3 \cdot 2 = 8x^3$
$k = 2$ : $\binom{4}{2}x^2 \cdot 2^2 = 6 \cdot x^2 \cdot 4 = 24x^2$
$k = 3$ : $\binom{4}{3}x^1 \cdot 2^3 = 4 \cdot x \cdot 8 = 32x$
$k = 4$ : $\binom{4}{4}x^0 \cdot 2^4 = 1 \cdot 1 \cdot 16 = 16$

Therefore: $(x + 2)^4 = x^4 + 8x^3 + 24x^2 + 32x + 16$ The coefficients 1, 4, 6, 4, 1 come directly from row 4 of Pascal's triangle, then each is multiplied by the appropriate power of 2.

Example2

Finding a specific term in $(3a - b)^7$ Suppose we want only the term containing $a^3$ in the expansion of $(3a - b)^7$ . First, rewrite as $(3a + (-b))^7$ . The general term is:

\binom{7}{k}(3a)^{7-k}(-b)^k = \binom{7}{k} \cdot 3^{7-k} \cdot a^{7-k} \cdot (-1)^k \cdot b^k

For the power of $a$ to be 3, we need $7 - k = 3$ , so $k = 4$ . The term is:

\binom{7}{4} \cdot 3^{3} \cdot a^{3} \cdot (-1)^4 \cdot b^4

Computing: $\binom{7}{4} = \frac{7!}{4!3!} = \frac{7 \cdot 6 \cdot 5}{3 \cdot 2 \cdot 1} = 35$ Therefore the term is: $35 \cdot 27 \cdot a^3 \cdot 1 \cdot b^4 = 945a^3b^4$ This technique lets us find any specific term without expanding the entire expression.

Counterexample

Why we need non-negative integers: The binomial theorem as stated requires $n$ to be a non-negative integer. Consider what happens if we naively try to apply it with $n = -1$ : If we try $(1 + x)^{-1}$ and write $\binom{-1}{k} = \frac{(-1)!}{k!(-1-k)!}$ , we immediately encounter a problem: $(-1)!$ is undefined in the standard factorial definition, which only applies to non-negative integers. The correct expansion of $(1 + x)^{-1}$ is actually the infinite geometric series:

(1 + x)^{-1} = 1 - x + x^2 - x^3 + x^4 - \cdots

which is valid only for $|x| < 1$ . Newton extended the binomial theorem to all real exponents, but this requires generalized binomial coefficients and produces infinite series with convergence conditions. The finite sum formula only works for non-negative integer exponents.

🧠 Intuition

The Choosing Perspective: Imagine you're multiplying out $(a + b)^5 = (a+b)(a+b)(a+b)(a+b)(a+b)$ . To get a term, you walk through each of the 5 brackets and choose either the $a$ or the $b$ . Think of getting the term $a^2b^3$ . This means "choose $a$ from 2 brackets and $b$ from the other 3." How many ways can you do this? You need to choose which 2 brackets (out of 5) will contribute their $a$ . That's $\binom{5}{2} = 10$ ways. Visually, each path through the expansion tree represents one term in the final sum. Pascal's triangle emerges naturally: to get to any position in row $n$ , you can arrive from two positions in row $n-1$ (either you took the " $a$ path" or the " $b$ path" at the previous step). The number of paths to any location is the sum of paths to the two locations above it — exactly Pascal's identity!

connection

Fractal Geometry and the Sierpiński Triangle: When you color the odd numbers in Pascal's triangle one color and even numbers another color, a remarkable pattern emerges — the Sierpiński triangle, one of the most famous fractals. This connection between simple arithmetic patterns modulo 2 and geometric self-similarity reveals deep links between number theory, modular arithmetic, and fractal geometry. As you include more rows, the fractal structure becomes more apparent, demonstrating how discrete combinatorial objects can exhibit continuous geometric properties at scale. This connection, noticed by mathematicians in the 1960s, shows that Pascal's triangle encodes information far beyond simple arithmetic.

Binomial Theorem and Pascal's Triangle

Overview

Core Theory

Examples and Applications

Historical Development

Connections to Other Areas

What You Need First

What This Opens Up

See Also