Algebra › Section L · Sequences, series, and the binomial theorem › Topic L.4

The binomial theorem

Multiply (x + y)⁵ by hand and you will grind through dozens of terms before the dust settles. The binomial theorem is the shortcut: the expansion's shape is completely predictable, its coefficients hide in a triangle, and one formula finds any single term without expanding anything at all.

Why the theorem exists

Expanding \((x + y)^2\) by FOIL is fine; \((x + y)^3\) means multiplying again and collecting like terms; by \((x + y)^5\) the by-hand work is a slog of repeated distribution. But examine the finished expansions and rigid patterns appear — the same number of terms every time, exponents marching in straight lines, coefficients repeating symmetrically. The binomial theorem names those patterns and turns them into a formula, so an \(n\)th-power expansion costs one application of a rule instead of \(n\) rounds of distribution.

The shape of an expansion

In every expansion of \((a + b)^n\): there are \(n + 1\) terms; the first is \(a^n\) and the last is \(b^n\); the exponents on \(a\) decrease by one each term while those on \(b\) increase by one; and the exponents on any single term always sum to \(n\). Check \((x + y)^3 = x^3 + 3x^2y + 3xy^2 + y^3\): four terms, exponents \((3,0), (2,1), (1,2), (0,3)\) — every pair sums to 3. Only the coefficients remain unexplained, and those are the theorem's real content.

Pascal's triangle: the coefficient machine

Stack the coefficients of successive expansions and Pascal's triangle emerges: row 0 is \(1\); row 1 is \(1, 1\); then \(1, 2, 1\); \(1, 3, 3, 1\); \(1, 4, 6, 4, 1\); \(1, 5, 10, 10, 5, 1\). Each entry is the sum of the two entries above it, and row \(n\) carries the coefficients for \((a + b)^n\). To expand \((x + 2)^4\): take row 4 — \(1, 4, 6, 4, 1\) — and let the exponents march: \(x^4 + 4x^3(2) + 6x^2(2^2) + 4x(2^3) + 2^4\), which simplifies to \(x^4 + 8x^3 + 24x^2 + 32x + 16\).

Worked example: an expansion with alternating signs

Expand \((2x + 3)^3\) and \((a - b)^5\). For the first, row 3 is \(1, 3, 3, 1\): \((2x)^3 + 3(2x)^2(3) + 3(2x)(3^2) + 3^3 = 8x^3 + 36x^2 + 54x + 27\). For the second, a minus sign just alternates the signs — every odd power of \(b\) carries a negative: \(a^5 - 5a^4b + 10a^3b^2 - 10a^2b^3 + 5ab^4 - b^5\). The \(b\)-exponent, not the term's position, decides the sign: where \(b\) appears to an odd power, that term is negative.

Factorials: the counting shorthand

The notation \(n!\) (read '\(n\) factorial') means \(n(n-1)(n-2) \cdots 2 \cdot 1\): \(5! = 120\) and \(6!/4! = \frac{720}{24} = 30\) — dividing factorials cancels huge common runs of factors, since \(6!/4! = 6 \cdot 5\). One convention deserves its flag: \(0! = 1\). It looks arbitrary but is exactly what makes the counting formulas work, the same way an empty product is 1. Factorials grow ferociously — \(10!\) is already 3,628,800 — which is why the formulas below always cancel before anyone computes.

Binomial coefficients: n choose r

The \(r\)th coefficient of \((a+b)^n\) is the binomial coefficient \(\binom{n}{r} = \frac{n!}{r!\,(n-r)!}\), read '\(n\) choose \(r\)'. Evaluate \(\binom{5}{2}\): \(\frac{120}{2 \cdot 6} = 10\) — and there it is, sitting in Pascal's row 5. The notation has beautiful symmetry: \(\binom{n}{r} = \binom{n}{n-r}\), so \(\binom{7}{3} = \binom{7}{4} = 35\), which is why every Pascal row reads the same forwards and backwards. And \(\binom{n}{0} = \binom{n}{n} = 1\) — the first and last coefficients, where \(0! = 1\) earns its keep.

Worked example: the theorem in action

Assembling the pieces:

(a + b)^n = \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 = \sum_{r=0}^{n} \binom{n}{r} a^{n-r} b^r.

Each term is a binomial coefficient times a falling power of \(a\) times a rising power of \(b\). For \((x + 2)^5\): the coefficients are \(1, 5, 10, 10, 5, 1\), giving \(x^5 + 5x^4(2) + 10x^3(4) + 10x^2(8) + 5x(16) + 32\), which simplifies to \(x^5 + 10x^4 + 40x^3 + 80x^2 + 80x + 32\). The theorem is Pascal's triangle with the arithmetic explained.

One term, no expansion

The theorem's best trick is skipping the expansion entirely. The \(k\)th term of \((a + b)^n\) is \(\binom{n}{k-1} a^{n-k+1} b^{k-1}\) — subtract one from the term's position for the coefficient and the \(b\)-exponent. The third term of \((x + 2)^5\) is \(\binom{5}{2} x^3 (2^2) = 10 \cdot 4 \cdot x^3 = 40x^3\), matching the full expansion above without ever writing it. For a minus sign, the same formula applies and the resulting \(b\)-power's parity sets the sign. When a problem asks for one term of a tenth-power expansion, this is the only sane route.

Common mistakes to avoid

First, reading Pascal's triangle off by one row — row \(n\) matches power \(n\), and the row count starts at zero, so \((a+b)^4\) wants \(1, 4, 6, 4, 1\). Second, expanding \((a - b)^n\) without alternating signs, or attaching the sign to the term's position instead of the \(b\)-exponent. Third, computing \(\binom{n}{r}\) as \(\frac{n!}{r!}\) — the \((n-r)!\) in the denominator is what scales the coefficient down. Fourth, forgetting \(0! = 1\) and mangling the end coefficients. Fifth, the specific-term off-by-one: the \(k\)th term involves \(\binom{n}{k-1}\), \(b^{k-1}\), and \(a^{n-k+1}\) — one less and one more, never \(k\) itself.

Key takeaways

Every expansion of \((a+b)^n\) has \(n+1\) terms, with \(a\)'s exponents falling from \(n\) to 0, \(b\)'s rising from 0 to \(n\), and each term's exponents summing to \(n\). Pascal's triangle supplies the coefficients — each entry the sum of the two above — and the binomial coefficient \(\binom{n}{r} = \frac{n!}{r!(n-r)!}\) supplies each one directly, symmetric in \(r\) and \(n - r\), anchored by \(0! = 1\). The Binomial Theorem assembles this into \(\sum \binom{n}{r} a^{n-r} b^r\), and its specific-term form \(\binom{n}{k-1} a^{n-k+1} b^{k-1}\) extracts any single term with no expansion at all. Minus signs ride on the \(b\)-exponents, and the off-by-one — term \(k\), index \(k-1\) — is the whole game at the edges.

Flashcards

Flashcard

(a + b)ⁿ expansion

n + 1 terms

Powers 0 through n on b.

Test your understanding

Question 1 of 5

Expand (x + 2)⁴.

Question 2 of 5

Evaluate the binomial coefficient 5 choose 2.

Question 3 of 5

How many terms does the expansion of (a + b)⁹ have?

Question 4 of 5

Find the third term of (x + 2)⁵ without expanding.

Question 5 of 5

Which row of Pascal's triangle gives the coefficients of (a + b)⁵?

← Previous topic