The Binomial Theorem

Squaring $(a+b)$ is easy — you memorized $(a+b)^2 = a^2 + 2ab + b^2$ years ago. But what about $(a+b)^7$? Multiplying seven factors by hand is a nightmare of bookkeeping, and it is precisely the kind of tedious, error-prone task that begs for a pattern. The binomial theorem is that pattern: a single, elegant formula that tells you every term of $(a+b)^n$ — the coefficients, the exponents, and how many terms there are — without multiplying anything out.

What makes this theorem beautiful is that the coefficients are not arbitrary. They are counting numbers — they answer the question "in how many ways can I choose things?" That hidden link between algebra (expanding brackets) and combinatorics (counting choices) is one of the most satisfying connections in all of mathematics, and once you see it, the binomial theorem stops being a formula to memorize and becomes something you understand.

Learning Objectives

• Expand $(a+b)^n$ for any positive integer $n$ using the binomial theorem.
• Construct and use Pascal's triangle to find binomial coefficients quickly.
• Compute binomial coefficients $\binom{n}{k}$ and explain why they equal the number of combinations.
• Find a specific term in an expansion without writing out the whole thing.
• Understand the historical motivation and Newton's generalized binomial series for non-integer powers.

Quick Answer

The binomial theorem states that for a positive integer $n$:

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

where the binomial coefficient $\binom{n}{k} = \dfrac{n!}{k!\,(n-k)!}$ counts the number of ways to choose $k$ items from $n$. The expansion has $n+1$ terms; the powers of $a$ count down from $n$ to $0$ while the powers of $b$ count up from $0$ to $n$, and every term's exponents sum to $n$. The coefficients are exactly the numbers in row $n$ of Pascal's triangle. Newton later extended the theorem to any real exponent, producing an infinite series that underpins much of calculus.

Where It Came From

The need was practical and ancient: people had to expand powers of sums to solve equations, compute compound interest, and — crucially — to extract roots. Around the 10th–11th centuries, mathematicians in the Islamic world and India already knew the coefficient pattern. The Persian polymath al-Karaji (c. 1000 CE) and later al-Samaw'al described the triangular array of coefficients and proved the expansion for small powers by a form of induction. In India, Halayudha (10th century) commented on the Meru-Prastara, the same triangle, in the context of counting poetic meters — combinations of long and short syllables. In China, Jia Xian (11th century) and Yang Hui (13th century) tabulated the triangle as a tool for root extraction, which is why Chinese texts call it Yang Hui's triangle.

So why is it named after Blaise Pascal (1623–1662)? Pascal did not discover the triangle, but in his 1654 Traité du triangle arithmétique he was the first to study its properties systematically and, above all, to connect it explicitly to combinations and probability — work he did in correspondence with Fermat while founding probability theory. That unifying insight, linking algebra to counting, earned his name the lasting attachment in the West.

The revolutionary leap came from Isaac Newton around 1665. He asked a bold question: what if the exponent $n$ is not a positive integer — what if it is a fraction like $\tfrac{1}{2}$ (a square root) or negative? He discovered that the same coefficient pattern still works, but the sum never terminates — it becomes an infinite series. This generalized binomial series let Newton compute square roots, areas, and ultimately became a foundational tool for the calculus he was inventing. The humble bracket-expansion had grown into an engine of analysis.

Expanding (a+b)^n: The Theorem in Action

Let us see the pattern by building up. Multiplying carefully:

• $(a+b)^1 = a + b$
• $(a+b)^2 = a^2 + 2ab + b^2$
• $(a+b)^3 = a^3 + 3a^2b + 3ab^2 + b^3$
• $(a+b)^4 = a^4 + 4a^3b + 6a^2b^2 + 4ab^3 + b^4$

Three patterns jump out. First, the powers of $a$ decrease from $n$ to $0$ and the powers of $b$ increase from $0$ to $n$; in every term the exponents add to $n$. Second, the coefficients are symmetric (they read the same forwards and backwards). Third, those coefficients — $1,4,6,4,1$ for $n=4$ — are the binomial coefficients.

Worked Example. Expand $(2x + 3)^4$.

The template is $\sum_{k=0}^{4}\binom{4}{k}(2x)^{4-k}(3)^k$ with coefficients $1,4,6,4,1$:

$(2x+3)^4 = 1\cdot(2x)^4 + 4\cdot(2x)^3(3) + 6\cdot(2x)^2(3)^2 + 4\cdot(2x)(3)^3 + 1\cdot(3)^4$

Compute each term:

• $1 \cdot 16x^4 = 16x^4$
• $4 \cdot 8x^3 \cdot 3 = 96x^3$
• $6 \cdot 4x^2 \cdot 9 = 216x^2$
• $4 \cdot 2x \cdot 27 = 216x$
• $1 \cdot 81 = 81$

So $(2x+3)^4 = 16x^4 + 96x^3 + 216x^2 + 216x + 81$. Notice we substituted whole chunks — the $a$ was $2x$ and the $b$ was $3$ — and raised each chunk to its full power. Forgetting to raise the coefficient inside (e.g. writing $2x^4$ instead of $16x^4$) is the single most common slip.

Pascal's Triangle: The Coefficients for Free

You do not need factorials to find the coefficients — you can grow them. Pascal's triangle starts with a $1$ at the top; each entry below is the sum of the two entries diagonally above it, with $1$s down both edges:

n=0:            1
n=1:          1   1
n=2:        1   2   1
n=3:      1   3   3   1
n=4:    1   4   6   4   1
n=5:  1   5  10  10   5   1
n=6: 1  6  15  20  15   6  1

Row $n$ gives the coefficients of $(a+b)^n$. For instance, row 5 tells us instantly:

$(a+b)^5 = a^5 + 5a^4b + 10a^3b^2 + 10a^2b^3 + 5ab^4 + b^5$

The construction rule is Pascal's identity: $\binom{n}{k} = \binom{n-1}{k-1} + \binom{n-1}{k}$. It has a lovely meaning in terms of choosing: to choose $k$ things from $n$, either you include the last item (then choose $k-1$ from the remaining $n-1$) or you exclude it (choose $k$ from $n-1$). The two cases add up — exactly the addition in the triangle.

Binomial Coefficients and Combinations

Here is the deep "why." Consider $(a+b)^3 = (a+b)(a+b)(a+b)$. To form a term, you pick either $a$ or $b$ from each of the three factors and multiply. The term $a^2 b$ arises every time you pick $b$ from exactly one of the three brackets. How many ways can you choose which one bracket contributes the $b$? That is $\binom{3}{1} = 3$ ways — which is exactly its coefficient. This is why the coefficient of $a^{n-k}b^k$ is $\binom{n}{k}$: it counts the number of ways to choose $k$ of the $n$ factors to supply a $b$.

The formula is

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

Worked Example. Find the coefficient of $x^5$ in $(x + 2)^8$.

The general term is $\binom{8}{k} x^{8-k} 2^k$. We need $8-k = 5$, so $k = 3$:

$\binom{8}{3} x^{5} 2^{3} = \frac{8!}{3!\,5!}\cdot x^5 \cdot 8 = 56 \cdot 8 \cdot x^5 = 448\,x^5$

The coefficient is $448$. Being able to isolate one term like this — without expanding all nine terms — is what makes the theorem powerful in practice.

Worked Example (the general term). Find the term independent of $x$ (the constant term) in $\left(x^2 + \dfrac{1}{x}\right)^6$.

General term: $\binom{6}{k}(x^2)^{6-k}\left(\dfrac{1}{x}\right)^k = \binom{6}{k} x^{12-2k} x^{-k} = \binom{6}{k} x^{12-3k}$.

The constant term needs $12 - 3k = 0$, so $k = 4$:

$\binom{6}{4} = 15$

The constant term is $15$.

Newton's Generalized Binomial Series

Newton's insight: allow any real exponent $r$. Then

$(1+x)^r = \sum_{k=0}^{\infty}\binom{r}{k} x^k = 1 + rx + \frac{r(r-1)}{2!}x^2 + \frac{r(r-1)(r-2)}{3!}x^3 + \cdots$

where $\binom{r}{k} = \dfrac{r(r-1)\cdots(r-k+1)}{k!}$. When $r$ is a positive integer the factors eventually hit zero and the series stops (recovering the ordinary theorem). Otherwise it runs forever and converges only when $|x| < 1$.

Worked Example. Approximate $\sqrt{1.02}$ using $r = \tfrac{1}{2}$, $x = 0.02$:

$(1+x)^{1/2} \approx 1 + \tfrac{1}{2}x - \tfrac{1}{8}x^2$

$= 1 + \tfrac{1}{2}(0.02) - \tfrac{1}{8}(0.0004) = 1 + 0.01 - 0.00005 = 1.00995$

The true value is $1.009950\ldots$ — two terms already give five-digit accuracy. This is how mathematicians computed roots before calculators.

Real-World Applications

• Probability and statistics. The binomial distribution — the probability of $k$ successes in $n$ trials — is literally $\binom{n}{k}p^k(1-p)^{n-k}$, a single term of the expansion of $(p + (1-p))^n$. Coin flips, quality-control defect rates, and A/B tests all rest on it.
• Compound interest and finance. Expanding $(1 + r)^n$ shows how interest compounds term by term, and Newton's series lets analysts approximate $(1+r)^{1/12}$ for monthly rates.
• Engineering approximations. Physicists constantly replace $(1+x)^r$ by its first two terms $1 + rx$ for small $x$ — the basis of countless "small-angle" and "linearization" shortcuts.
• Computer science. Binomial coefficients count subsets, paths in a grid, and appear throughout algorithm analysis and combinatorics.

Common Mistakes

Mistake 1: Forgetting to raise the whole term. In $(2x+3)^4$, writing the first term as $2x^4$ instead of $(2x)^4 = 16x^4$. Why wrong: the exponent applies to the entire chunk $2x$, coefficient included. Correction: always bracket and raise the full quantity: $(2x)^4 = 2^4 x^4$.

Mistake 2: Sign errors with $(a-b)^n$. Treating $(a-b)^n$ like $(a+b)^n$. Why wrong: the $b$ is negative, so odd powers of $b$ make the term negative. Correction: write it as $(a + (-b))^n$; the signs then alternate $+,-,+,-,\ldots$. E.g. $(x-1)^3 = x^3 - 3x^2 + 3x - 1$.

Mistake 3: Confusing the term number with $k$. Assuming "the 4th term" means $k=4$. Why wrong: the sum starts at $k = 0$, so the 4th term corresponds to $k = 3$. Correction: the $(r+1)$-th term is $\binom{n}{r}a^{n-r}b^r$; subtract one from the term number to get $k$.

Comparison and Connections

The binomial coefficient wears several hats. The table shows how the same numbers appear in different contexts.

Notation / idea	Meaning	Reads as
$\binom{n}{k}$	Binomial coefficient	"$n$ choose $k$"
${}^nC_k$ or $C(n,k)$	Combinations	ways to choose $k$ from $n$
Row $n$ of Pascal's triangle	The list of all $\binom{n}{k}$	coefficients of $(a+b)^n$
Coefficient of $a^{n-k}b^k$	Same number	how many terms collapse together

Two close cousins to keep distinct: permutations ${}^nP_k = \frac{n!}{(n-k)!}$ count ordered arrangements, while combinations $\binom{n}{k}$ count unordered selections — and only combinations appear as binomial coefficients, because in $(a+b)^n$ the order of the factors you pick from does not matter. The binomial theorem is also the two-variable special case of the more general multinomial theorem, which expands $(a+b+c+\cdots)^n$.

Practice Questions

Recall

State the binomial theorem for a positive integer $n$ and write row 5 of Pascal's triangle.

Answer: $(a+b)^n = \sum_{k=0}^{n}\binom{n}{k}a^{n-k}b^k$. Row 5: $1, 5, 10, 10, 5, 1$.

Understanding

Explain why the coefficient of $a^2 b^3$ in $(a+b)^5$ equals $\binom{5}{3}$.

Guidance: Each of the 5 factors contributes an $a$ or a $b$; the term $a^2 b^3$ appears once for every way of choosing which 3 of the 5 factors supply a $b$. That count is $\binom{5}{3} = 10$.

Application

Find the coefficient of $x^3$ in $(1 + 2x)^7$.

Answer: General term $\binom{7}{k}(2x)^k$. Set $k=3$: $\binom{7}{3}2^3 = 35 \cdot 8 = 280$. Coefficient is $280$.

Analysis

Show that the sum of all entries in row $n$ of Pascal's triangle is $2^n$, and explain what this means combinatorially.

Guidance: Set $a = b = 1$ in the theorem: $(1+1)^n = \sum_{k=0}^{n}\binom{n}{k} = 2^n$. Combinatorially, the total number of subsets of an $n$-element set (choosing $0$, $1$, …, or $n$ elements) is $2^n$, since each element is independently in or out.

FAQ

Why does the expansion have exactly $n+1$ terms? Because $k$ runs over the integers $0, 1, 2, \ldots, n$ — that is $n+1$ values, one term each. The powers of $b$ range from $0$ up to $n$.

Do I need to memorize the factorial formula, or can I just use Pascal's triangle? For small $n$ the triangle is faster and less error-prone. For large $n$ or when you only want one term deep in the expansion, the formula $\binom{n}{k} = \frac{n!}{k!(n-k)!}$ is the tool — building 30 rows of a triangle to find one coefficient is wasteful.

What happens with $(a-b)^n$? Replace $b$ with $-b$. The signs alternate: $(a-b)^n = \sum_{k=0}^{n}\binom{n}{k}a^{n-k}(-b)^k = \sum (-1)^k \binom{n}{k} a^{n-k} b^k$. Terms with odd $k$ are negative.

Why does Newton's series need $|x| < 1$? For non-integer exponents the series is infinite. If $|x| \ge 1$ the terms do not shrink to zero fast enough and the sum diverges (blows up), so the approximation is only valid for small $x$.

How is $\binom{n}{0} = 1$? Choosing zero things seems like nothing. There is exactly one way to choose nothing — take the empty selection. This also makes the formula consistent: $\binom{n}{0} = \frac{n!}{0!\,n!} = 1$, using the convention $0! = 1$.

Quick Revision

• Theorem: $(a+b)^n = \sum_{k=0}^{n}\binom{n}{k}a^{n-k}b^k$, with $n+1$ terms.
• Coefficient: $\binom{n}{k} = \frac{n!}{k!(n-k)!}$ = number of ways to choose $k$ from $n$.
• Pascal's rule: $\binom{n}{k} = \binom{n-1}{k-1} + \binom{n-1}{k}$; edges are $1$.
• General term ($(r+1)$-th): $\binom{n}{r}a^{n-r}b^r$ — set the exponent to isolate a specific term.
• Row sum: $\sum_k \binom{n}{k} = 2^n$; symmetry: $\binom{n}{k} = \binom{n}{n-k}$.
• Newton: $(1+x)^r = \sum_{k=0}^{\infty}\binom{r}{k}x^k$ for real $r$, valid when $|x| < 1$.

Related Topics

Prerequisites

• Algebra overview

Related Topics

• Permutations and Combinations
• The Binomial Probability Distribution
• Sequences and Series

Next Topics

• Newton's generalized binomial series and its role in Calculus
• The multinomial theorem