The binomial theorem describes exactly how to expand any power of a binomial — an expression with two terms, such as (a + b) or (x + 2) — into a sum of individual terms. Instead of multiplying a binomial by itself ten, twenty, or a hundred times, the theorem gives a direct formula that produces every term at once. Statisticians, probability theorists, engineers, and algebra students all use it for the same reason: it turns a repetitive multiplication problem into a systematic counting problem.
This article explains the binomial theorem formula, shows you how binomial coefficients work, connects the theorem to Pascal’s triangle, and walks through fully worked numeric examples step by step. It also clarifies the key distinction between the binomial theorem and the binomial distribution, two concepts that share a name but serve entirely different purposes.
What Is the Binomial Theorem?
The binomial theorem states that for any real numbers a and b and any non-negative integer n, the expansion of (a + b)ⁿ is:
(a + b)^n = Σ C(n, k) · a^(n-k) · b^k [sum for k = 0 to n]
where C(n, k) is the binomial coefficient, read “n choose k.” The sum runs from k = 0 up to k = n, producing exactly n + 1 terms.
Written out term by term, the expansion looks like this:
(a + b)^n = C(n,0)·a^n + C(n,1)·a^(n-1)·b
+ C(n,2)·a^(n-2)·b^2 + ... + C(n,n)·b^n
The first term has a raised to the full power n and b raised to 0. Each subsequent term shifts one power from a to b. The last term has a raised to 0 and b raised to the full power n.
The coefficient on each term — C(n, k) — counts the number of ways to choose which k of the n factors of (a + b) contribute a b rather than an a. That counting interpretation is why combinatorics and the binomial theorem are inseparable.
Why “Binomial”?
A binomial is any algebraic expression containing exactly two terms: a + b, x − y, 2x + 3, or p + q are all binomials. The prefix bi- simply means two. The theorem applies to any binomial raised to a non-negative integer power.
The binomial case is special because its expansion has a clean, recursive coefficient structure that Pascal’s triangle and the combinatorial formula both exploit. Trinomials and higher polynomials have their own expansion identities, but none as elegant or widely applied as the binomial theorem.
Understanding Binomial Coefficients
The binomial coefficient C(n, k) — also written ⁿCₖ, nCk, or with the vertical-bar notation in textbooks — counts the number of ways to choose k items from n items without regard to order. Its formula uses factorials:
C(n, k) = n! / ( k! · (n - k)! )
where n! (n factorial) means n × (n−1) × (n−2) × … × 2 × 1, and 0! = 1 by convention.
For example:
C(4, 2) = 4! / (2! · 2!)
= (4 × 3 × 2 × 1) / ((2 × 1) × (2 × 1))
= 24 / 4
= 6
Reading C(4, 2) as “4 choose 2”: there are 6 ways to choose 2 items from 4. The same coefficient appears as the third term in the expansion of (a + b)⁴.
A few key properties that simplify calculation:
- C(n, 0) = 1 — there is exactly one way to choose zero items: choose nothing.
- C(n, n) = 1 — there is exactly one way to choose all n items.
- C(n, k) = C(n, n−k) — choosing k items produces the same count as leaving n−k unchosen. This symmetry cuts computation nearly in half for large expansions.
- C(n, 1) = n — there are n ways to choose exactly one item from n.
The full set of binomial coefficients for n = 4 is:
C(4,0) = 1
C(4,1) = 4
C(4,2) = 6
C(4,3) = 4
C(4,4) = 1
Notice the symmetry: 1, 4, 6, 4, 1 — reading left to right or right to left gives the same sequence. This symmetry property holds for every row.
Binomial coefficients are also known as combination counts: C(n, k) is the number of k-element subsets of an n-element set. That connection to combinations is why the binomial theorem is at home in combinatorics.
Pascal’s Triangle and the Binomial Theorem
Pascal’s triangle is a triangular array in which each entry is the sum of the two entries directly above it. Row 0 starts with a single 1. Every binomial expansion pulls its coefficients directly from the corresponding row of Pascal’s triangle:
Row 0: 1
Row 1: 1 1
Row 2: 1 2 1
Row 3: 1 3 3 1
Row 4: 1 4 6 4 1
Row 5: 1 5 10 10 5 1
Row n of Pascal’s triangle lists the binomial coefficients for (a + b)ⁿ in order. For (a + b)⁴, row 4 gives 1, 4, 6, 4, 1 — exactly C(4,0) through C(4,4).
Pascal’s Identity
The rule that each entry is the sum of its two parents above it is called Pascal’s identity:
C(n, k) = C(n-1, k-1) + C(n-1, k)
This recursive relationship lets you build each row from the previous one without computing any factorials. To extend the triangle from row 4 to row 5: place 1s at both ends, and fill each interior entry by summing the two entries above it: 1+4 = 5, 4+6 = 10, 6+4 = 10, 4+1 = 5.
Why the Triangle Works
Consider multiplying (a + b) × (a + b). Each term in the product picks either the a or the b from each factor:
- Both factors give a → a²
- First gives a, second gives b → ab
- First gives b, second gives a → ab (same as above)
- Both factors give b → b²
Combining like terms gives a² + 2ab + b². The coefficient 2 counts the two ways of picking one b from two factors — that is C(2, 1) = 2.
For three factors (a + b)³, the coefficient on a²b is C(3, 1) = 3 because there are three ways to choose which one of the three factors supplies the b. This counting argument scales to any n, and it is the core intuition behind the theorem.
Applying the Binomial Theorem: Step-by-Step Method
Expanding (a + b)ⁿ systematically takes four steps:
- Identify a, b, and n. Write out which part is a, which is b, and what the power is.
- List the binomial coefficients. Compute C(n, 0) through C(n, n) using the factorial formula, or read row n from Pascal’s triangle.
- Write each term. For k = 0, 1, 2, …, n, each term is C(n, k) · a^(n−k) · b^k.
- Simplify. Multiply numerical constants and simplify exponents as needed.
Fully Worked Example: Expanding (x + 2)⁴
Expand (x + 2)⁴ using the binomial theorem.
Identify the pieces: a = x, b = 2, n = 4.
Binomial coefficients for n = 4 (from row 4 of Pascal’s triangle):
C(4,0) = 1
C(4,1) = 4
C(4,2) = 6
C(4,3) = 4
C(4,4) = 1
Write each term using the formula:
k=0: C(4,0) · x^4 · 2^0 = 1 · x^4 · 1 = x^4
k=1: C(4,1) · x^3 · 2^1 = 4 · x^3 · 2 = 8x^3
k=2: C(4,2) · x^2 · 2^2 = 6 · x^2 · 4 = 24x^2
k=3: C(4,3) · x^1 · 2^3 = 4 · x · 8 = 32x
k=4: C(4,4) · x^0 · 2^4 = 1 · 1 · 16 = 16
Final result:
(x + 2)^4 = x^4 + 8x^3 + 24x^2 + 32x + 16
Verification of coefficients:
- Coefficient of x³: C(4,1) × 2¹ = 4 × 2 = 8 ✓
- Coefficient of x²: C(4,2) × 2² = 6 × 4 = 24 ✓
- Coefficient of x: C(4,3) × 2³ = 4 × 8 = 32 ✓
- Constant term: C(4,4) × 2⁴ = 1 × 16 = 16 ✓
Expanding (a − b)ⁿ: Handling Subtraction
When the second term is negative — such as (a − b)ⁿ — rewrite it as (a + (−b))ⁿ and apply the theorem exactly as above. The key difference: powers of (−b) alternate in sign.
Example: (x − 3)³. Set a = x, b = −3, n = 3.
k=0: C(3,0) · x^3 · (-3)^0 = 1 · x^3 · 1 = x^3
k=1: C(3,1) · x^2 · (-3)^1 = 3 · x^2 · (-3) = -9x^2
k=2: C(3,2) · x^1 · (-3)^2 = 3 · x · 9 = 27x
k=3: C(3,3) · x^0 · (-3)^3 = 1 · 1 · (-27) = -27
Result: (x − 3)³ = x³ − 9x² + 27x − 27.
The alternating signs arise because odd powers of (−3) are negative and even powers are positive. This pattern holds for any (a − b)ⁿ expansion.
Binomial Theorem vs. Binomial Distribution
A common point of confusion: the binomial theorem and the binomial distribution share a name but serve entirely different purposes.
The binomial theorem is an algebraic identity. It expands (a + b)ⁿ into a polynomial sum. It applies to any numbers a and b and any non-negative integer n. It is a tool of algebra and combinatorics.
The binomial distribution is a probability model. It describes the number of successes in a fixed number of independent trials, each with the same probability of success p. The probability of exactly k successes in n trials is:
P(X = k) = C(n, k) · p^k · (1 - p)^(n-k)
That formula does use binomial coefficients C(n, k) — which is why the two share the name “binomial.” But the objects themselves are different:
- The theorem produces a polynomial in a and b.
- The distribution produces probabilities for a random variable.
If you want to expand (2x + 3)⁵, you use the binomial theorem. If you want to find the probability of exactly 3 heads in 5 fair coin flips, you use the binomial distribution. The binomial coefficient formula C(n, k) = n!/(k!(n−k)!) appears in both, but its role differs.
Special Cases and Applications
Sum of All Binomial Coefficients
Setting a = b = 1 in the binomial theorem gives:
(1 + 1)^n = Σ C(n, k) = 2^n
The sum of all binomial coefficients in row n equals 2ⁿ. For n = 4: 1 + 4 + 6 + 4 + 1 = 16 = 2⁴. The combinatorial meaning: a set with n elements has exactly 2ⁿ subsets (including the empty set and the full set).
Setting a = 1, b = −1:
(1 - 1)^n = 0 = Σ (-1)^k · C(n, k) [for n ≥ 1]
The alternating sum of any row of Pascal’s triangle (for n ≥ 1) equals zero: 1 − 4 + 6 − 4 + 1 = 0. This identity is fundamental in inclusion–exclusion arguments in combinatorics and probability.
The Middle Term
For even n, the largest binomial coefficient is the middle one: C(n, n/2). For n = 6, the middle coefficient is C(6, 3) = 20. This is the term with the highest numerical value in the expansion, and it plays a role in probability approximations — the normal approximation to the binomial distribution concentrates probability near this middle value.
Finding a Specific Term Without Full Expansion
The (r + 1)-th term of (a + b)ⁿ is:
T(r+1) = C(n, r) · a^(n-r) · b^r
Set r to the desired position (r = 0 for the first term, r = 1 for the second). To find the term containing a specific power of b, identify r from the exponent on b and substitute.
Example: Find the term containing x² in (x + 3)⁵.
Set b^r = x², so r = 2 (with a = 3, b = x, n = 5):
T(3) = C(5, 2) · 3^(5-2) · x^2 = 10 · 27 · x^2 = 270x^2
This selective approach avoids computing all six terms of the expansion.
The Generalised Binomial Series
Isaac Newton extended the binomial theorem to non-integer and negative values of n as an infinite series. For |x| < 1 and any real exponent α:
(1 + x)^α = 1 + αx + α(α-1)/2! · x^2 + α(α-1)(α-2)/3! · x^3 + ...
This binomial series converges when |x| < 1 and is essential in calculus for approximating expressions like (1 + x)^(1/2) or (1 − x)^(−1). The first-order approximation (1 + x)^n ≈ 1 + nx is used in physics and engineering whenever x is very small.
The standard (finite-sum) binomial theorem is the special case where α is a non-negative integer, the series terminates after n + 1 terms, and convergence is not an issue.
Common Mistakes with the Binomial Theorem
Forgetting to Raise the Second Term to Its Power
In each term C(n, k) · a^(n−k) · b^k, the b must be raised to the power k. A common error is writing the coefficient as C(n, k) alone without multiplying by b^k. In (x + 2)⁴, the k = 2 term contributes C(4,2) × 2² = 6 × 4 = 24, not just 6. Always include the full numerical factor from both a^(n−k) and b^k.
Sign Errors in (a − b)ⁿ Expansions
When expanding (a − b)ⁿ, students frequently get the signs right for some terms but miscalculate the numerical coefficient because they forgot to apply (−1)^k. Write b as (−b) explicitly from the start, then track sign separately from magnitude as you raise to successive powers.
Applying the Finite Form to Non-Integer n
The standard binomial theorem (finite sum, exactly n + 1 terms) holds only for non-negative integer n. For fractional or negative exponents, the generalised binomial series applies — an infinite sum valid only for |x| < 1. Treating a fractional power as if it produced a finite polynomial is a common error in calculus problems.
Confusing C(n, k) with nᵏ
The binomial coefficient C(n, k) is not n raised to the power k. C(4, 2) = 6, while 4² = 16. These are completely different quantities. Make sure you are applying the factorial formula n!/(k!(n−k)!) or reading from Pascal’s triangle, not computing an exponent.
Off-by-One on the Number of Terms
The expansion of (a + b)ⁿ has n + 1 terms, not n. The k-index runs from 0 to n inclusive. A student expecting n terms may omit either the first term (k = 0, where a carries the full power) or the last term (k = n, where b carries the full power). Use the indices 0, 1, 2, …, n systematically every time.
Frequently Asked Questions
What is the binomial theorem?
The binomial theorem is the formula (a + b)ⁿ = Σ C(n, k) · a^(n−k) · b^k for k from 0 to n. It expands any power of a two-term sum into a polynomial with n + 1 terms, where each coefficient is a binomial coefficient C(n, k). The theorem is a fundamental result in algebra and combinatorics, connecting polynomial expansions to counting problems.
What is a binomial coefficient?
A binomial coefficient C(n, k) — “n choose k” — counts the number of ways to select k elements from a set of n elements without regard to order. Its value is n! ÷ (k! × (n−k)!). In the binomial theorem, C(n, k) is the coefficient of the term containing a^(n−k) and b^k. You can compute it with the factorial formula or read it directly from row n of Pascal’s triangle.
How does Pascal’s triangle give the binomial coefficients?
Row n of Pascal’s triangle lists the binomial coefficients C(n, 0), C(n, 1), …, C(n, n) in order — exactly the coefficients you need for expanding (a + b)ⁿ. Each entry in the triangle equals the sum of the two entries directly above it, which follows from Pascal’s identity: C(n, k) = C(n−1, k−1) + C(n−1, k). Building the triangle row by row is often faster than computing factorials for small n.
How many terms does (a + b)ⁿ have?
The expansion of (a + b)ⁿ always has exactly n + 1 terms. For n = 4 there are 5 terms; for n = 10 there are 11 terms. The k-index runs from 0 to n inclusive, which is n + 1 values.
What is the difference between the binomial theorem and the binomial distribution?
The binomial theorem is an algebraic identity for expanding (a + b)ⁿ into a polynomial. The binomial distribution is a probability model for counting successes in repeated independent trials. Both use the binomial coefficient C(n, k), but the theorem gives a polynomial result while the distribution gives probabilities. They are related in origin — the binomial distribution’s formula is structurally similar to one term of the binomial expansion — but they are used in different branches of mathematics.
Can you use the binomial theorem when n is not a whole number?
Not as a finite sum. For non-negative integers, the expansion terminates after n + 1 terms and is exact. For fractional or negative n, Newton’s generalised binomial series applies — an infinite series that converges for |x| < 1. This series is important in calculus and mathematical physics for computing approximations, but it requires careful attention to convergence.
How do you find a specific term in (a + b)ⁿ?
The (r + 1)-th term is T(r+1) = C(n, r) · a^(n−r) · b^r. To find the term containing b^r, identify r from the power of b you want, then compute the coefficient. For example, to find the term containing x² in (x + 3)⁵: r = 2, so T(3) = C(5, 2) · 3³ · x² = 10 · 27 · x² = 270x².
How is the binomial theorem connected to combinations?
The binomial coefficient C(n, k) counts combinations — the number of ways to choose k items from n. When you multiply n copies of (a + b) together, each term in the product results from independently choosing a or b from each factor. The number of ways to get exactly k b’s (and therefore n−k a’s) from n factors is C(n, k). This combinatorial origin is why the binomial theorem is a topic in combinatorics, not just algebra.
Summary
The binomial theorem converts the repeated multiplication of a two-term expression into a single, systematic formula: (a + b)ⁿ = Σ C(n, k) · a^(n−k) · b^k. The coefficients C(n, k) count the number of ways to distribute a’s and b’s across the n factors. You can read those coefficients from Pascal’s triangle or compute them with the factorial formula n!/(k!(n−k)!). The result always has n + 1 terms, and the coefficients are symmetric.
Three ideas to carry forward:
- Coefficients come from counting. C(n, k) is a combinatorial quantity — it counts how many of the n copies of (a + b) contribute a b. That is why the binomial theorem lives in combinatorics.
- Pascal’s triangle is the shortcut. For small n, reading coefficients off the triangle is faster than computing factorials.
- Binomial theorem ≠ binomial distribution. The theorem is an algebraic identity; the distribution is a probability model. They share binomial coefficients but serve different mathematical purposes.
For the underlying combinatorial theory and identities involving binomial coefficients, see the NIST Digital Library of Mathematical Functions, Chapter 26 — Combinatorial Analysis, and for worked examples within an open-access curriculum, see OpenStax College Algebra 2e, Section 13.6 — The Binomial Theorem.
To calculate C(n, k) values directly, use the combination calculator. You can also explore all our combinatorics and statistics tools on the calculators hub.