Binomial Theorem

Q: What is the binomial theorem?

The binomial theorem gives a formula for expanding (a+b)^n for any non-negative integer n: (a+b)^n = sum from k=0 to n of C(n,k) × a^(n-k) × b^k. The coefficients C(n,k) are binomial coefficients, equal to n! / (k!(n-k)!), and they form the rows of Pascal's triangle.

Q: What is Pascal's triangle?

Pascal's triangle is the triangular array of binomial coefficients. Row n gives the coefficients of (a+b)^n. Each entry is the sum of the two directly above it. Named after Blaise Pascal (1654), but the structure was known much earlier to Chinese, Persian, and Indian mathematicians.

Q: How do you calculate a binomial coefficient?

C(n,k) = n! / (k! × (n-k)!). Example: C(5,2) = 120/(2 × 6) = 10. Pascal's triangle gives the same numbers visually — the kth entry in row n is C(n,k). For large n, software computes the coefficient via the factorial formula or via the recursion C(n,k) = C(n-1,k-1) + C(n-1,k).

Q: What is the binomial distribution?

The probability distribution for the number of successes in n independent trials, each with success probability p. P(X = k) = C(n,k) × p^k × (1-p)^(n-k). Used everywhere in probability and statistics — coin flips, quality control, polling, A/B testing. The binomial theorem is the math that makes the distribution sum to 1 across all possible k values.

Q: Did Newton invent the binomial theorem?

Not for integer exponents — that case was known centuries earlier. Newton's contribution (1665) was extending the theorem to non-integer exponents (fractional, negative, irrational). His generalized binomial series is the basis for Taylor expansions of (1+x)^α and underlies much of calculus.

Q: What is the binomial theorem used for in physics?

Mostly for first-order approximations. For small x, (1+x)^n ≈ 1 + nx. This linear approximation shows up in relativistic energy expansion, gravitational potential at large distances, Taylor expansion of arbitrary functions, error analysis, and dozens of other contexts. The full binomial theorem is also used in probability calculations and combinatorial counting.

The binomial theorem gives a clean formula for expanding any power of a sum: $ (a+b)^n $ for any non-negative integer $ n $. It tells you exactly what coefficients appear in front of each term, without having to multiply the expression out manually. The coefficients follow Pascal’s triangle — the same triangle of numbers that shows up in combinatorics, probability, and surprisingly often in the rest of mathematics. Isaac Newton extended the theorem to non-integer exponents in 1665, but the integer case has been known since the medieval Arab and Indian mathematicians.

Binomial theorem and Pascal's triangle — Pascal’s triangle and the binomial theorem.

The Theorem

For any 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} $ (read ‘n choose k’) is:

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

This single formula gives you every term in the expansion of $ (a+b)^n $ without manual multiplication.

Worked Examples

$ (a+b)^2 $: coefficients $ \binom{2}{0}, \binom{2}{1}, \binom{2}{2} = 1, 2, 1 $. Expansion: $ a^2 + 2ab + b^2 $. The familiar square-of-a-sum identity falls out directly.

$ (a+b)^3 $: coefficients 1, 3, 3, 1. Expansion: $ a^3 + 3a^2b + 3ab^2 + b^3 $.

$ (a+b)^4 $: coefficients 1, 4, 6, 4, 1. Expansion: $ a^4 + 4a^3b + 6a^2b^2 + 4ab^3 + b^4 $.

$ (2x+3)^5 $: coefficients 1, 5, 10, 10, 5, 1. Substituting $ a=2x, b=3 $: $ (2x)^5 + 5(2x)^4(3) + 10(2x)^3(3)^2 + 10(2x)^2(3)^3 + 5(2x)(3)^4 + (3)^5 = 32x^5 + 240x^4 + 720x^3 + 1080x^2 + 810x + 243 $.

Pascal’s Triangle

The binomial coefficients form Pascal’s triangle — each row gives the coefficients of the corresponding binomial expansion.

$$ \begin{array}{c} 1 \\ 1\;\;1 \\ 1\;\;2\;\;1 \\ 1\;\;3\;\;3\;\;1 \\ 1\;\;4\;\;6\;\;4\;\;1 \\ 1\;\;5\;\;10\;\;10\;\;5\;\;1 \end{array} $$

Each entry is the sum of the two directly above it. The triangle was known in China (Yang Hui, 13th century), Persia (al-Karaji, 10th century), and Europe (Pascal, 1654). The full structure is older than Pascal’s claim.

Why It Works

When you multiply out $ (a+b)^n = (a+b)(a+b) \cdots (a+b) $ with $ n $ factors, each term in the expansion comes from choosing either $ a $ or $ b $ from each factor. A term with $ k $ copies of $ b $ and $ n-k $ copies of $ a $ is $ a^{n-k} b^k $. The number of ways to choose which $ k $ of the $ n $ factors contribute a $ b $ is exactly $ \binom{n}{k} $. That’s the binomial coefficient. So the term $ a^{n-k} b^k $ appears $ \binom{n}{k} $ times in the expansion.

Applications

Combinatorics. $ \binom{n}{k} $ is the number of ways to choose $ k $ items from $ n $ — used everywhere in counting problems.
Probability. The binomial distribution gives the probability of getting exactly $ k $ successes in $ n $ independent trials, each with success probability $ p $: $ P(X=k) = \binom{n}{k} p^k (1-p)^{n-k} $.
Newton’s generalized binomial. Newton extended the theorem to fractional and negative exponents using infinite series: $ (1+x)^\alpha = 1 + \alpha x + \frac{\alpha(\alpha-1)}{2!}x^2 + \cdots $ for $ |x| < 1 $. This is the basis of Taylor approximations for fractional powers.
Approximation. The first two terms of $ (1+x)^n $ — namely $ 1 + nx $ — give the linear approximation widely used in physics for small $ x $.

Frequently Asked Questions

What is the binomial theorem?

The binomial theorem gives a formula for expanding (a+b)^n for any non-negative integer n: (a+b)^n = sum from k=0 to n of C(n,k) × a^(n-k) × b^k. The coefficients C(n,k) are binomial coefficients, equal to n! / (k!(n-k)!), and they form the rows of Pascal’s triangle.

What is Pascal’s triangle?

Pascal’s triangle is the triangular array of binomial coefficients. Row n gives the coefficients of (a+b)^n. Each entry is the sum of the two directly above it. Named after Blaise Pascal (1654), but the structure was known much earlier to Chinese, Persian, and Indian mathematicians.

How do you calculate a binomial coefficient?

C(n,k) = n! / (k! × (n-k)!). Example: C(5,2) = 120/(2 × 6) = 10. Pascal’s triangle gives the same numbers visually — the kth entry in row n is C(n,k). For large n, software computes the coefficient via the factorial formula or via the recursion C(n,k) = C(n-1,k-1) + C(n-1,k).

What is the binomial distribution?

The probability distribution for the number of successes in n independent trials, each with success probability p. P(X = k) = C(n,k) × p^k × (1-p)^(n-k). Used everywhere in probability and statistics — coin flips, quality control, polling, A/B testing. The binomial theorem is the math that makes the distribution sum to 1 across all possible k values.

Did Newton invent the binomial theorem?

Not for integer exponents — that case was known centuries earlier. Newton’s contribution (1665) was extending the theorem to non-integer exponents (fractional, negative, irrational). His generalized binomial series is the basis for Taylor expansions of (1+x)^α and underlies much of calculus.

What is the binomial theorem used for in physics?

Mostly for first-order approximations. For small x, (1+x)^n ≈ 1 + nx. This linear approximation shows up in relativistic energy expansion, gravitational potential at large distances, Taylor expansion of arbitrary functions, error analysis, and dozens of other contexts. The full binomial theorem is also used in probability calculations and combinatorial counting.