The Binomial Theorem Made Practical: Expanding (a + b)ⁿ Term by Term

Squaring (a + b) is easy enough to do in your head: a² + 2ab + b². Cubing it is still manageable. But the moment someone asks you to expand (a + b)⁷, or to pull the coefficient of x³ out of (2x + 3)⁵, brute force stops being fun. The binomial theorem turns that grind into a pattern you can read off in seconds, and once the pattern clicks it stays useful well past algebra class — it shows up again in probability, in series approximations, and anywhere counting matters.

This post walks through what the theorem actually says, why Pascal's triangle is hiding inside it, and how to read a single term without writing the whole expansion. Along the way I'll point at the Binomial Expansion Calculator so you can check each step against an exact answer instead of trusting your arithmetic at thirty digits.

What the binomial theorem says

The theorem is a single line:

(a + b)ⁿ = Σ C(n,k) · a^(n−k) · b^k,  for k from 0 to n

Read it slowly. The expansion is a sum of n + 1 terms. Each term has three pieces: a number out front called the binomial coefficient C(n,k), a falling power of a, and a rising power of b. As k walks from 0 up to n, the power on a drops from n down to 0 while the power on b climbs from 0 up to n. The two exponents always add up to n. That last fact is a quick sanity check: if a term's a-power and b-power don't sum to n, something went wrong.

The single most important detail to memorize: the coefficient of the k-th term is exactly C(n,k). Not roughly, not approximately — the count of ways to choose k items from n is literally the number you write in front of a^(n−k)·b^k. That is why combinatorics and algebra keep bumping into each other.

A worked example: (a + b)³

Let me do one fully by hand so the machinery is visible. For n = 3 the index k runs 0, 1, 2, 3, giving four terms.

k = 0: C(3,0) · a³ · b⁰ = 1 · a³ = a³
k = 1: C(3,1) · a² · b¹ = 3 · a²b = 3a²b
k = 2: C(3,2) · a¹ · b² = 3 · ab² = 3ab²
k = 3: C(3,3) · a⁰ · b³ = 1 · b³ = b³

Add them up and you get the answer worth remembering:

(a + b)³ = a³ + 3a²b + 3ab² + b³

Notice the coefficients 1, 3, 3, 1 and how the powers slide in opposite directions. Every binomial expansion has this shape; only the row of coefficients and the size of the exponents change. If you want to confirm the pattern at larger n, type the exponent into the Binomial Expansion Calculator and it lists each term with its powers attached, so you can match them line by line against your own work.

Where Pascal's triangle comes in

The coefficients 1, 3, 3, 1 are not random — they are row 3 of Pascal's triangle. Each row of the triangle is exactly the list of coefficients for the corresponding power of (a + b):

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

Two things make this triangle elegant. First, every interior entry is the sum of the two numbers directly above it: the 6 in row 4 is 3 + 3 from row 3. Second, that same entry equals C(n,k). So you can build the coefficients additively without ever computing a factorial, which is how people did it for centuries before pocket calculators. Row 4 reads 1 4 6 4 1, and sure enough (a + b)⁴ = a⁴ + 4a³b + 6a²b² + 4ab³ + b⁴. If you'd rather see the triangle itself drawn out instead of the algebraic terms, the Pascal's triangle tool renders the rows directly.

Reading just one term

Exam questions rarely want the whole expansion. They ask for the coefficient of x³ or the fifth term — one piece, not all of them. The general-term formula handles that directly:

T = C(n,k) · a^(n−k) · b^k   (counting from k = 0)

The trap here is off-by-one. The term for k = 0 is the first term, so "the fourth term" means k = 3, not k = 4. Once you fix k, you have the whole term in one shot. For (a + b)⁷ with k = 2:

C(7,2) · a⁵ · b² = 21a⁵b²

No need to write the other seven terms. When real numbers are involved — say the coefficient of x³ in (2x + 3)⁵ — substitute a = 2x and b = 3 and the same formula gives the numeric coefficient. The x³ term sits where the a-power is 3, which is k = 2: C(5,2)·(2)³·(3)² = 10·8·9 = 720, so the coefficient is 720. One caution from experience: when the binomial is (x − 1)ⁿ, plug in b = −1, not 1, or every sign comes out positive and the odd terms are wrong.

Why exactness matters more than you'd think

Here's where I learned to stop trusting a normal calculator. The first time I expanded a high-power binomial for a probability problem, I plugged the central coefficient into a spreadsheet and got an answer that looked right — fifteen clean digits — but was quietly wrong in the last few places. Binomial coefficients outgrow the safe-integer range fast: C(60,30) is already a 17-digit number, and C(100,50) has thirty digits. Floating-point arithmetic rounds anything that big, so the digits you actually need silently drift. That is exactly the situation where a tool that computes with arbitrary-precision integers earns its place — every coefficient comes out exact to the last digit instead of approximately.

Once you start substituting numeric coefficients the problem gets worse, because a^(n−k)·b^k for large n is enormous on its own, long before you multiply by the coefficient. For homework the difference might be invisible; for a real combinatorics or finance calculation, a rounded coefficient is just a wrong answer wearing a confident face.

Where the pattern keeps paying off

The binomial theorem is the bridge between three subjects that look separate at first. In algebra it expands powers of sums. In combinatorics the same C(n,k) counts subsets, and Pascal's triangle is a counting table. In probability the expansion of (p + q)ⁿ with p + q = 1 gives the binomial distribution directly — each term C(n,k)·pᵏ·qⁿ⁻ᵏ is the chance of exactly k successes in n trials. The coefficients you practiced expanding in algebra are the same numbers that tell you how likely seven heads in ten flips is.

That is why it's worth learning the pattern rather than memorizing a few small cases. You expand (a + b)ⁿ once and the structure — falling powers, rising powers, C(n,k) out front — carries over everywhere the theorem appears. Type an exponent into the Binomial Expansion Calculator, read the terms, and let the pattern do the heavy lifting.

Made by Toolora · Updated 2026-06-13