Skip to content
K Knidox Search…
Math · Algebra

Binomial Expansion

Expand (a + b)ⁿ term by term, with exact coefficients for any power up to 30.

Up to 30. The expansion has n + 1 terms.
(x + y)⁵
6 terms

Coefficients sum to 32 = 2⁵

x⁵ + 5x⁴y + 10x³y² + 10x²y³ + 5xy⁴ + y⁵

Term by term
kC(n, k)PowersTerm
015 + 0 = 5x⁵
154 + 1 = 55x⁴y
2103 + 2 = 510x³y²
3102 + 3 = 510x²y³
451 + 4 = 55xy⁴
510 + 5 = 5y⁵

The binomial theorem expands (a + b)ⁿ without multiplying the brackets out. Each term is C(n, k)·aⁿ⁻ᵏ·bᵏ, and the powers always sum to n. So (x + y)⁵ = x⁵ + 5x⁴y + 10x³y² + 10x²y³ + 5xy⁴ + y⁵.

Why the coefficients are what they are

Expanding (a + b)ⁿ means choosing, from each of the n brackets, either an a or a b. A term with exactly k copies of b arises once for every way of picking which k brackets contribute the b — and that count is C(n, k). The coefficients are not a pattern to memorise; they are the number of ways each term can happen.

That also explains Pascal’s triangle. Each entry is the sum of the two above it because choosing k items from n either includes the last item (leaving k − 1 from n − 1) or does not (leaving k from n − 1). The triangle is the recurrence C(n, k) = C(n−1, k−1) + C(n−1, k) drawn out.

Two patterns worth carrying

The expansion has n + 1 terms, and the powers of a and b always add to n — a quick check on any line you write. And setting a = b = 1 makes every term its own coefficient, so the coefficients of row n sum to 2ⁿ: 1 + 5 + 10 + 10 + 5 + 1 = 32 for n = 5.

(a + b)ⁿ = Σk=0..n C(n, k)·aⁿ⁻ᵏ·bᵏ

C(n, k) = n! ÷ (k!(n − k)!); for (a − b)ⁿ the signs alternate, starting positive

  1. 1
    Write out the coefficients. For n = 5 they are 1, 5, 10, 10, 5, 1 — row five of Pascal’s triangle.
  2. 2
    Start the powers of a at n and count down. x⁵, x⁴, x³, x², x, then x⁰ = 1.
  3. 3
    Start the powers of b at 0 and count up. 1, y, y², y³, y⁴, y⁵ — the two exponents always sum to 5.
  4. 4
    Put them together. x⁵ + 5x⁴y + 10x³y² + 10x²y³ + 5xy⁴ + y⁵.
  5. 5
    Alternate the signs for a difference. (x − y)⁵ has the same coefficients with signs + − + − + −, since each odd power of −y is negative.

Pascal’s triangle to row 6

Each entry is the sum of the two above it. Row n gives the coefficients of (a + b)ⁿ.

nCoefficientsSum = 2ⁿ
011
11 12
21 2 14
31 3 3 18
41 4 6 4 116
51 5 10 10 5 132
61 6 15 20 15 6 164

Finding one term without expanding the rest

Exam questions often ask only for a particular term, and there is no need to build the whole expansion. The term containing bᵏ is C(n, k)·aⁿ⁻ᵏ·bᵏ, so the x²y³ term of (x + y)⁵ is C(5, 3)·x²·y³ = 10x²y³. Counting is the only trap: the term with bᵏ is the (k + 1)th term, because the first term has k = 0.

Two notes on scope. The signs for (a − b)ⁿ alternate because (−b)ᵏ is negative for odd k, so a difference raised to an even power ends positive and to an odd power ends negative. And this page handles non-negative integer n, where the expansion terminates; for a fractional or negative exponent the binomial series is infinite and converges only for |x| < 1, which is a different object covered on the series page.

What is the binomial theorem?
A formula for expanding (a + b)ⁿ without multiplying out: the sum over k of C(n, k)·aⁿ⁻ᵏ·bᵏ. It gives n + 1 terms whose exponents always add to n.
Where do the coefficients come from?
They count how many ways each term can arise. A term with k copies of b comes from choosing which k of the n brackets contribute a b, and that number of ways is C(n, k).
How do I find just one term?
Use C(n, k)·aⁿ⁻ᵏ·bᵏ for the power of b you want. The x²y³ term of (x + y)⁵ is C(5, 3)·x²y³ = 10x²y³, with no need to write the rest.
What happens to the signs with (a − b)ⁿ?
They alternate, starting positive, because each odd power of −b is negative. The coefficients themselves are unchanged.
Why do the coefficients sum to 2ⁿ?
Setting a = b = 1 makes every term equal to its own coefficient, and the left side becomes 2ⁿ. So row 5 sums to 32 and row 6 to 64.
Is the binomial coefficient the same as a combination?
Yes — C(n, k) is read as "n choose k" and counts the ways of choosing k items from n without regard to order. The same number does both jobs.
Does the theorem work for fractional powers?
There is a version that does, but it produces an infinite series rather than a finite expansion, and it only converges for |x| &lt; 1. This page covers the terminating case where n is a non-negative integer.