The binomial theorem gives a closed-form expansion of (a+b)n(a + b)^n for any non-negative integer nn:

(a+b)n=k=0n(nk)ankbk(a + b)^n = \sum_{k=0}^{n} \binom{n}{k} a^{n-k} b^k

The coefficients (nk)=n!k!(nk)!\binom{n}{k} = \frac{n!}{k!(n-k)!} are called binomial coefficients; they are the entries of Pascal’s triangle.

The pattern

For small nn you can expand by hand:

  • (a+b)2=a2+2ab+b2(a+b)^2 = a^2 + 2ab + b^2
  • (a+b)3=a3+3a2b+3ab2+b3(a+b)^3 = a^3 + 3a^2b + 3ab^2 + b^3
  • (a+b)4=a4+4a3b+6a2b2+4ab3+b4(a+b)^4 = a^4 + 4a^3b + 6a^2b^2 + 4ab^3 + b^4

The coefficients 1,2,11, 2, 1 and 1,3,3,11, 3, 3, 1 and 1,4,6,4,11, 4, 6, 4, 1 are rows of Pascal’s triangle — each entry the sum of the two above it.

The theorem states this pattern continues for every positive integer nn.

Why the coefficients are “choose” numbers

When you expand (a+b)n(a+b)^n, you’re choosing, for each of the nn factors, whether to contribute an aa or a bb. The coefficient of ankbka^{n-k}b^k counts how many ways you can pick exactly kk of the nn factors to contribute bb. That is precisely (nk)\binom{n}{k} — the number of ways to choose kk items from nn.

This combinatorial interpretation is why the binomial theorem sits at the intersection of algebra and probability: every probability problem about independent trials (flipping a coin nn times, drawing cards with replacement) involves binomial coefficients.

Pascal’s triangle

Long before algebra had symbolic notation, the triangular array of numbers later named after Blaise Pascal (1653) was known in many cultures. The Chinese mathematician Jia Xian used it in the 11th century; Omar Khayyam referenced it in Persia around 1100; Indian mathematicians as early as the 3rd century BCE studied its patterns.

The triangle encodes binomial coefficients but also contains the Fibonacci numbers (along certain diagonals), triangular and tetrahedral numbers, and the powers of 2 (as row sums).

Newton’s leap

The theorem for integer nn was well established by the 17th century. Isaac Newton’s great insight, around 1665, was that the formula also makes sense for fractional and negative exponents — but in that case the sum becomes infinite.

For example:

(1+x)1/2=1+12x18x2+116x3(1 + x)^{1/2} = 1 + \tfrac{1}{2}x - \tfrac{1}{8}x^2 + \tfrac{1}{16}x^3 - \cdots

This generalized binomial theorem was one of Newton’s first major achievements. It led directly to the systematic use of power series in mathematics and, via series expansions, to calculus itself. Taylor series (1715) are a direct descendant of Newton’s generalization.

Everyday uses

The binomial theorem shows up wherever you compute powers of sums:

  • Expanding products in algebra
  • Computing probabilities in repeated independent trials (P(kP(k successes in nn trials)=(nk)pk(1p)nk) = \binom{n}{k} p^k (1-p)^{n-k})
  • Approximating functions with Taylor polynomials
  • Deriving generating functions in combinatorics

It is also the pedagogical bridge from algebra to the broader world of series and calculus — the first time most students see that an algebraic identity can be “extended” into an infinite structure.

Frequently asked

Who formulated the binomial theorem?

The theorem for positive integer exponents was known to ancient Indian, Chinese, and Islamic mathematicians. Isaac Newton generalized it to any real exponent around 1665 — his version, the Generalized Binomial Theorem, was one of his first major mathematical achievements.

What are binomial coefficients?

The coefficients C(n, k) = n! / (k!(n−k)!) that count the number of ways to choose k items from n. They appear in Pascal's triangle and connect algebra to combinatorics.

What is Newton's generalization?

Newton showed that the theorem also works for fractional and negative exponents, producing infinite series instead of finite sums. This led directly to the theory of power series and to calculus.