Binomial theorem

The binomial theorem (or binomial expansion) is a fundamental algebraic formula that describes the expansion of powers of a binomial in terms of sums of monomials with binomial coefficients. It states that for any nonnegative integer n and any real or complex numbers x and y, the nth power of the sum x + y can be expressed as

\[
(x+y)^n = \sum_{k=0}^{n} \binom{n}{k} x^{n-k} y^k,
\]

where \(\binom{n}{k} = \frac{n!}{k!(n-k)!}\) is the binomial coefficient, often read as "n choose k". The theorem is central to combinatorics, probability, and analysis, and it admits generalizations to real and complex exponents.

Statement

For any integer n ≥ 0 and any elements x and y of a commutative ring (such as real numbers), the binomial theorem can be written as

\[
(x+y)^n = \binom{n}{0}x^n y^0 + \binom{n}{1}x^{n-1}y^1 + \binom{n}{2}x^{n-2}y^2 + \cdots + \binom{n}{n}x^0 y^n,
\]

or more compactly using summation notation. The binomial coefficients satisfy the symmetry property \(\binom{n}{k} = \binom{n}{n-k}\) and can be arranged in Pascal's triangle, where each entry is the sum of the two entries directly above it. The theorem holds for any commutative ring, including fields like the real numbers, complex numbers, and finite fields.

History

The binomial theorem for positive integer exponents was known to ancient mathematicians. The Greek mathematician Euclid (c. 300 BCE) described the case n = 2 in his Elements. Indian mathematicians like Pingala (c. 200 BCE) and later Bhāskara II (12th century) studied binomial coefficients for combinatorial purposes. The Persian mathematician Al-Karaji (c. 1000 CE) provided a geometric proof of the binomial theorem for n = 3 and described the binomial triangle. Islamic mathematicians such as Omar Khayyám (c. 1100) were aware of the general pattern.

In China, Yang Hui (13th century) presented the triangle of binomial coefficients, now known as Pascal's triangle in the West. The theorem was fully formulated for all positive integers by the 17th century, with contributions from Pierre de Fermat, Blaise Pascal, and Sir Isaac Newton. Newton generalized the theorem to non-integer exponents, giving an infinite series expansion now called the generalized binomial theorem or Newton's binomial theorem.

Combinatorial Interpretation

The binomial coefficient \(\binom{n}{k}\) equals the number of ways to choose k objects from a set of n distinct objects. The expansion of \((x+y)^n\) can be understood combinatorially: each term in the expansion corresponds to selecting either x or y from each of the n factors. The coefficient counts the number of ways to obtain exactly k y-factors (and n−k x-factors). This interpretation is the foundation of many combinatorial identities, including the binomial theorem itself.

Pascal's triangle provides a convenient way to compute binomial coefficients: the row number n (starting with row 0) gives the coefficients for \((x+y)^n\). The triangle is constructed by placing 1 at the apex and adding adjacent numbers from the row above to obtain entries in the next row.

Proofs

Algebraic Induction

The binomial theorem can be proved by mathematical induction on n. The base case n = 0 yields \((x+y)^0 = 1 = \binom{0}{0}x^0 y^0\). Assuming the formula holds for n, multiply both sides by (x + y) and use the recurrence \(\binom{n}{k} + \binom{n}{k-1} = \binom{n+1}{k}\) to obtain the result for n+1.

Combinatorial Proof

A direct combinatorial argument: Consider the product \((x+y)^n = (x+y)(x+y)\cdots(x+y)\) (n factors). When expanding, each term corresponds to picking, from each factor, either x or y. The term \(x^{n-k}y^k\) occurs when k of the n factors contribute y (and the remaining n−k contribute x). The number of ways to choose which k factors give y is \(\binom{n}{k}\), hence the coefficient.

Generalizations

Newton’s Generalized Binomial Theorem

For any real or complex exponent r, the binomial series is

\[
(1+z)^r = \sum_{k=0}^{\infty} \binom{r}{k} z^k,
\]

where \(\binom{r}{k} = \frac{r(r-1)\cdots(r-k+1)}{k!}\) is the generalized binomial coefficient. The series converges for |z| < 1 (and also for |z| = 1 under suitable conditions). This expansion was discovered by Isaac Newton and is essential in analysis.

Multinomial Theorem

The binomial theorem extends to sums of more than two terms. For any m-term sum and nonnegative integer n,

\[
(x_1 + x_2 + \cdots + x_m)^n = \sum_{k_1+k_2+\cdots+k_m=n} \frac{n!}{k_1!\,k_2!\cdots k_m!} x_1^{k_1} x_2^{k_2}\cdots x_m^{k_m},
\]

where the sum runs over all m-tuples of nonnegative integers summing to n.

Negative and Fractional Exponents

For exponents that are negative integers, the binomial theorem gives an infinite series that is a special case of the negative binomial series, useful in probability theory (negative binomial distribution). Fractional exponents lead to expansions involving roots and are used in calculus.

Applications

The binomial theorem has wide applications:

• Algebra: Simplifying polynomials and deriving identities.
• Combinatorics: Counting subsets, generating functions, and the inclusion–exclusion principle.
• Probability: The binomial distribution models the number of successes in n independent Bernoulli trials.
• Calculus: Expanding functions as power series (e.g., \(\sqrt{1+x}\)) and approximating functions.
• Numerical analysis: Efficient computation of powers using the binomial theorem for small exponents.
• Number theory: Proving divisibility properties (e.g., using the theorem to show that \((1+1)^n = 2^n\) is an integer).

See also

• Pascal’s triangle
• Binomial coefficient
• Multinomial theorem
• Binomial series
• Binomial distribution
• Negative binomial distribution
• Generating function

References

• Graham, R. L., Knuth, D. E., & Patashnik, O. (1994). Concrete Mathematics: A Foundation for Computer Science (2nd ed.). Addison-Wesley.
• Abramowitz, M., & Stegun, I. A. (1972). Handbook of Mathematical Functions. Dover.
• Edwards, A. W. F. (2002). Pascal’s Arithmetical Triangle. Johns Hopkins University Press.