Definition:Binomial Coefficient

Definition
Let $n \in \Z: n \ge 0$, and $k \in \Z$.

Then the symbol $\displaystyle \binom n k$ is interpreted as:


 * $\displaystyle \binom n k = \begin{cases}

\displaystyle \frac {n!} {k! \left({n - k}\right)!} & : 0 \le k \le n \\ & \\ 0 & : \text { otherwise } \end{cases}$

The number $\displaystyle \binom n k$ is known as a binomial coefficient.

See the Binomial Theorem for the reason why.

$\displaystyle \binom n k$ is often read $n$ choose $k$.

This arises from the fact that $\displaystyle \binom n k$ is the number of different ways $k$ objects can be chosen (irrespective of order) from a set of $n$ objects.

See Cardinality of Set of Subsets for a proof.

Notation
The notation $\displaystyle \binom n k$ was introduced by Andreas von Ettingshausen in his 1826 work Die combinatorische Analysis. It appears to have become the de facto standard.

Alternative notations include $C(n, k)$, ${}^n C_k$, ${}_n C_k$, $C^n_k$ and $C_n^k$, all of which can be confusing.

Historical Note
The binomial coefficients have been known about since at least the ancient Greeks and Romans, who were familiar with them for small values of $k$.

See the historical note to Pascal's Triangle for further history.

Also see

 * Properties of Binomial Coefficients
 * Cardinality of Set of Subsets


 * Pascal's Rule for a recurrence relation for defining the binomial coefficients.