Binomial coefficient

The binomial coefficient of the natural number n and the integer k is defined to be the natural number

<math> {n \choose k} = \frac{n!}{k!(n-k)!} \quad \mbox{if } n\geq k\geq 0 \qquad \mbox{(1)} </math>

and

<math> {n \choose k} = 0 \quad \mbox{if } k<0 \mbox{ or } k>n. </math>

(Here m! denotes the factorial of m). The binomial coefficient of n and k is also written as C(n, k) or ⁿC_k (C for combination) and read as "n choose k".

For example,

<math> {7 \choose 3} = \frac{7\cdot 6 \cdot 5}{3\cdot 2\cdot 1} = 35.</math>

The binomial coefficients are the coefficients in the expansion of the binomial (x + y)ⁿ (hence the name):

<math> (x+y)^n = \sum_{k=0}^{n} {n \choose k} x^k y^{n-k} \qquad (2) </math>

This is generalized by the binomial theorem, which allows the exponent n to be negative or a non-integer.

The important recurrence relation

<math>{n \choose k} + {n \choose k+1} = {n+1\choose k+1} \qquad (3) </math>

follows directly from the definition. This recurrence relation can be used to prove by mathematical induction that C(n, k) is a natural number for all n and k, a fact that is not immediately obvious from the definition. It also gives rise to 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 6         1   6   15  20  15   6   1
 row 7       1   7   21  35  35   21  7   1
 row 8     1   8   28  56  70  56   28  8   1

Row number n contains the numbers C(n, k) for k = 0,...,n. It is constructed by starting with ones at the outside and then always adding two adjacent numbers and writing the sum directly underneath. This method allows the quick calculation of binomial coefficients without the need for fractions or multiplications. For instance, by looking at row number 5 of the triangle, one can quickly read off that

(x + y)⁵ = 1x⁵ + 5 x⁴y + 10 x³y² + 10 x²y³ + 5 x y⁴ + 1y⁵.

The triangle was described by Zhu Shijie in 1303 AD in his book Precious Mirror of the Four Elements. In his book, Zhu mentioned the triangle as an ancient method (over 200 years before his time) for solving binomial coefficients, which indicated that the method was known to Chinese mathematicians five centuries before Pascal.

If you color in all even numbers on this triangle and leave the odd numbers blank, you get the Sierpinski triangle. Try coloring in multiples of 3, 4, 5, and so on and see what patterns emerge!

Table of contents 1 Combinatorics and statistics 2 Formulas involving binomial coefficients 3 Divisors of binomial coefficients 4 Generalization to complex arguments

Combinatorics and statistics

Binomial coefficients are of importance in combinatorics, because they provide ready formulas for certain frequent counting problems:

• every set with n elements has C(n, k) different subsets having k elements each (these are called k-combinations)
• the number of strings of length n containing k ones and n-k zeros is C(n, k)
• there are C(n+1, k) strings consisting of k ones and n zeros such that no two ones are adjacent
• the number of sequences consisting of n natural numbers whose sum equals k is C(n+k-1, k); this is also the number of ways to choose k elements from a set of n if repetitions are allowed.
• the Catalan numbers have an easy formula involving binomial coefficients; they can be used to count various structures, such as trees and parenthesized expressions.

The binomial coefficients also occur in the formula for the binomial distribution in statistics and in the formula for a Bézier curve.

Formulas involving binomial coefficients

The following formulas are occasionally useful:

     C(n, k) = C(n, n-k)          (4)

This follows from expansion (2) by using (x + y)ⁿ = (y + x)ⁿ.

<math> \sum_{k=0}^{n} \mathrm{C}(n,k) = 2^n \qquad (5) </math>

From expansion (2) using x = y = 1.

<math> \sum_{k=1}^{n} k \mathrm{C}(n,k) = n 2^{n-1} \qquad (6) </math>

From expansion (2), after differentiating and substituting x = y = 1.

<math> \sum_{j=0}^{k} \mathrm{C}(m,j) \mathrm{C}(n,k-j) = \mathrm{C}(m+n,k) \qquad (7) </math>

By expanding (x + y)ⁿ (x + y)^m = (x + y)^m+n with (2) (note that C(n, k) is defined to be zero if k > n). This equation generalizes (3).

<math> \sum_{k=0}^{n} \mathrm{C}(n,k)^2 = \mathrm{C}(2n,n) \qquad (8)</math>

From expansion (7) using m = k = n and (4).

<math> \sum_{k=0}^{n} \mathrm{C}(n-k,k) = \mathrm{F}(n+1) \qquad (9) </math>

Here, F(n+1) denotes the Fibonacci numbers. This formula about the diagonals of Pascal's triangle can be proven with induction using (3).

<math> \sum_{j=k}^{n} \mathrm{C}(j,k) = \mathrm{C}(n+1,k+1) \qquad (10) </math>

This can be proven by induction on n using (3).

Divisors of binomial coefficients

The prime divisors of C(n, k) can be interpreted as follows: if p is a prime number and p^r is the highest power of p which divides C(n, k), then r is equal to the number of natural numbers j such that the fractional part of k/p^j is bigger than the fractional part of n/p^j. In particular, C(n, k) is always divisible by n/gcd(n,k).

Generalization to complex arguments

The binomial coefficient C(z, k) can be defined for any complex number z and any natural number k as follows:

<math> \mathrm{C}(z,k) = \frac{z(z-1)(z-2)\dots (z-k+1)}{k!} \qquad (11) </math>

This generalization is used in the formulation of the binomial theorem and satisfies properties (3) and (7).

For fixed k, the expression C(z, k) is a polynomial in z of degree k with rational coefficients. Every polyomial p(z) of degree d can be written in the form

<math> p(z) = \sum_{k=0}^{d} a_k \mathrm{C}(z,k) </math>

with suitable constants a_k. This is important in the theory of difference equations[?] and can be seen as a discrete analog of Taylor's theorem.