Binomial Theorem and Pascal's Triangle

Binomial theorem expands $(a + b)^{n}$ systematically using formula: $(a + b)^{n} = \sum_{k = 0}^{n} (k n) a^{n - k} b^{k}$
Coefficients $(k n)$ equal entries in Pascal's triangle row $n$ , counting ways to choose $k$ objects from $n$
Bridges algebra and combinatorics: expansion coefficients represent both algebraic terms and combinatorial choices
Newton extended theorem (1665) from positive integers to fractional and negative exponents
Ancient mathematicians in India, Persia, and China studied Pascal's triangle patterns centuries before rigorous formulation
Applications span probability theory, calculus, and numerous scientific and engineering fields

Binomial Theorem and Pascal's Triangle

Overview

The binomial theorem is one of the most elegant and useful formulas in all of mathematics. It tells us how to expand expressions of the form $(a + b)^{n}$ — that is, how to write them as a sum of terms without actually multiplying out all the brackets. While you can easily verify that $(a + b)^{2} = a^{2} + 2 ab + b^{2}$ by hand, try computing $(a + b)^{10}$ the same way and you'll quickly appreciate why we need a systematic approach.

What makes the binomial theorem particularly beautiful is its deep connection to Pascal's triangle, a simple numerical pattern that was known to mathematicians across multiple civilizations. The coefficients that appear when you expand $(a + b)^{n}$ are exactly the numbers in the $n$ -th row of Pascal's triangle. This connection bridges algebra, combinatorics, and number theory in a profound way — the same numbers that count how many ways you can choose objects also tell you how algebraic expressions expand.

Historically, special cases of the binomial theorem were known to ancient mathematicians in India, Persia, and China, who studied Pascal's triangle (called different names in different cultures) as early as the 10th century. The general theorem for positive integer exponents was stated precisely by Isaac Newton in 1665, who also extended it to fractional and negative exponents. The theorem has since become fundamental to probability theory, calculus, and countless applications in science and engineering.

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.

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} = k = 0 \sum n (k n) a^{n - k} b^{k}

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

(k n) = \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

(k n)

. Each entry is the sum of the two entries directly above it, with 1's along the edges.

Core Theory

Main Result

Theorem (Binomial Theorem): For any real numbers

a, b

and non-negative integer

n

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

Theorem (Pascal's Identity): For any positive integers

n

and

k

with

1 \leq k \leq n

(k n) = (k - 1 n - 1) + (k n - 1) [2]

Theorem (Symmetry of Binomial Coefficients): For

0 \leq k \leq n

(k n) = (n - k n) [3]

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) \dots (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 $(k n)$ .

Since each selection pattern gives us the same term $a^{n - k} b^{k}$ , and there are $(k n)$ such patterns, the coefficient of $a^{n - k} b^{k}$ must be $(k n)$ .

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 $(k n)$ 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 $(k - 1 n - 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 $(k n - 1)$ ways.

Since these cases are mutually exclusive and exhaustive, $(k n) = (k - 1 n - 1) + (k n - 1)$ . □

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} + 2 ab + 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.

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.

Examples and Applications

1

Expanding $(x + 2)^{4}$

Using the binomial theorem with $a = x$ , $b = 2$ , and $n = 4$ :

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

Let's compute each term:

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

Therefore: $(x + 2)^{4} = x^{4} + 8 x^{3} + 24 x^{2} + 32 x + 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.

2

Finding a specific term in $(3 a - b)^{7}$

Suppose we want only the term containing $a^{3}$ in the expansion of $(3 a - b)^{7}$ .

First, rewrite as $(3 a + (- b))^{7}$ . The general term is:

(k 7) (3 a)^{7 - k} (- b)^{k} = (k 7) \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:

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

Computing: $(4 7) = \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} = 945 a^{3} b^{4}$

This technique lets us find any specific term without expanding the entire expression.

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 $(k - 1) = \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} - \dots

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.

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^{2} b^{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 $(2 5) = 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!

Historical Development

The triangular pattern now known as Pascal's triangle was discovered independently by multiple civilizations. The Persian mathematician Al-Karaji described it around 1000 CE, and the Chinese mathematician Yang Hui published it in 1261 CE (it's sometimes called Yang Hui's triangle in China). Indian mathematicians, including Pingala (around 200 BCE) and Halayudha (10th century CE), also knew the pattern in connection with Sanskrit prosody and combinatorics.

Blaise Pascal's 1653 treatise Traité du triangle arithmétique was not the first description of the triangle, but it was the most systematic treatment of its properties. Pascal showed how the triangle connected to probability theory, particularly in analyzing games of chance, which helped establish probability as a mathematical discipline.

Isaac Newton generalized the binomial theorem to fractional and negative exponents in 1665 (published later in 1676), writing it as an infinite series. This was a crucial step toward developing calculus and power series. The rigorous proof of the theorem for positive integers using mathematical induction became standard in the 19th century as mathematical proof standards were formalized.

The notation $(k n)$ for binomial coefficients became standard in the 20th century, chosen because these numbers appear as coefficients in binomial expansions and count combinations.

Connections to Other Areas

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