Square b3 · Mathematics · Queenside

Binomial

Binomial theorem expanding (x + y)^n.

Meaning

The binomial theorem expands a power of a sum as a sum of products. For a nonnegative integer nn, (x+y)n=∑k=0n(nk)xn−kyk,(x+y)^{n}=\sum_{k=0}^{n}\binom{n}{k}x^{n-k}y^{k}, where the binomial coefficient (nk)=n!k!(n−k)!\binom{n}{k}=\frac{n!}{k!(n-k)!} counts the ways to choose kk factors of yy from nn factors of (x+y)(x+y). Each term (nk)xn−kyk\binom{n}{k}x^{n-k}y^{k} is homogeneous of degree nn.

The identity holds in any commutative ring (with the usual interpretation of binomial coefficients), and it specializes to familiar rules such as (x+y)2=x2+2xy+y2(x+y)^{2}=x^{2}+2xy+y^{2}. For general real or complex exponents, Newton’s generalized binomial series replaces the finite sum by an infinite series convergent in a disk.

Context

Binomial expansions appear in Euclid for n=2n=2 and in the work of Indian mathematicians such as Pingala (combinatorial precursors) and later Halayudha, who related binomial coefficients to the Meru Prastara—a triangular array equivalent to Pascal’s triangle. Omar Khayyám and Chinese mathematicians of the Song dynasty knew the triangle of coefficients for higher nn. Blaise Pascal’s Traité du triangle arithmétique (published posthumously, 1665) systematically developed the combinatorial properties of (nk)\binom{n}{k} in Europe; Isaac Newton extended the expansion to fractional and negative exponents in the 1660s, a key step toward the calculus of series.

Combinatorially, (nk)\binom{n}{k} is the number of kk-subsets of an nn-set, so the binomial theorem is also a generating-function identity for subset counts. Probabilistically, it expands (p+q)n(p+q)^{n} for a binomial random variable. In algebra it interacts with the derivative (the product rule iterated nn times yields Leibniz’s rule with the same coefficients) and with finite differences.

The square earns its place because the binomial theorem is a universal expansion tool: it connects algebra to combinatorics, underwrites Taylor approximations of (1+x)α(1+x)^{\alpha}, and supplies the coefficients that appear across probability, statistics, and discrete mathematics. Few identities of comparable simplicity cast so long a shadow.

The same coefficients satisfy Pascal’s recurrence (nk)=(n−1k)+(n−1k−1)\binom{n}{k}=\binom{n-1}{k}+\binom{n-1}{k-1}, which both constructs the triangle and proves many identities by induction. Generating functions package the binomial theorem as (1+x)n=∑(nk)xk(1+x)^{n}=\sum\binom{n}{k}x^{k}, a viewpoint that scales to multinomial and qq-binomial analogues throughout modern combinatorics.

Sources