Visual Tools
Calculators
Tables
Mathematical Keyboard
Converters
Other Tools

How to Compute Binomial Coefficients

The binomial coefficient (nk)\binom{n}{k} is a ratio of factorials, but you never need the full factorials. Keep only kk factors on top, divide by k!k!, and cancel first so the numbers stay small.

Recognize the task

A value (nk)\binom{n}{k}, also written C(n,k)C(n, k) or nCk_nC_k, must be evaluated: (72)\binom{7}{2}, (129)\binom{12}{9}, (2018)\binom{20}{18}, an entry of Pascal's triangle, or a coefficient in a binomial expansion. Test: if kk is more than half of nn, switch to n−kn - k first.
The binomial coefficient is defined in the binomial coefficient lesson.

Two ways to do it

Falling factors over k!usual
(nk)=n(n−1)⋯(n−k+1)k!\binom{n}{k} = \dfrac{n(n-1)\cdots(n-k+1)}{k!}
The factorial definition after the (n−k)!(n-k)! cancels.
Pascal's ruletable
(nk)=(n−1k−1)+(n−1k)\binom{n}{k} = \binom{n-1}{k-1} + \binom{n-1}{k}
Add the two entries above it in Pascal's triangle (Pascal's rule).

Steps

StepOn (129)\binom{12}{9}
1Use symmetry if k is large. Choosing kk items is the same as leaving out n−kn - k (symmetry identity).(129)=(123)\binom{12}{9} = \binom{12}{3}
2Write k falling factors over k!. Start at nn and count down kk factors.Factorial ↗12⋅11⋅103!\dfrac{12 \cdot 11 \cdot 10}{3!}
3Cancel before multiplying. Divide the factors of k!k! into the top first; the result is always a whole number.126⋅11⋅10=2⋅110\dfrac{12}{6} \cdot 11 \cdot 10 = 2 \cdot 110
4Multiply what is left. Check that the answer is a whole number.220220

Worked examples

Example 1 · small k

two factors
(72)=7⋅62!\binom{7}{2} = \dfrac{7 \cdot 6}{2!}
two factors over 2!2!
=422= \dfrac{42}{2}
multiply
2121

Example 2 · large k

symmetry
(107)=(103)\binom{10}{7} = \binom{10}{3}
10−7=310 - 7 = 3
10⋅9⋅86=7206\dfrac{10 \cdot 9 \cdot 8}{6} = \dfrac{720}{6}
3!=63! = 6
120120

Example 3 · from the row above

Pascal's rule
(94)=(83)+(84)\binom{9}{4} = \binom{8}{3} + \binom{8}{4}
the two entries above
=56+70= 56 + 70
row 88 of the triangle
126126
See every entry as the sum of the two above it in the Pascal triangle visualizer.

See it happen

(nk)\binom{n}{k} counts the ways to choose kk of nn items. The ordered picks number n(n−1)⋯(n−k+1)n(n-1)\cdots(n-k+1), and every unordered choice appears k!k! times among them, so the quotient is always a whole number. That is also why cancelling works. Symmetry is the same count seen from the other side: choosing the n−kn - k items you leave out.

Common mistakes

Skipping symmetry

✗ (2018)=20⋅19⋯318!\binom{20}{18} = \dfrac{20 \cdot 19 \cdots 3}{18!}
✓ (2018)=(202)=20⋅192=190\binom{20}{18} = \binom{20}{2} = \dfrac{20 \cdot 19}{2} = 190

Forgetting the k! below

✗ (72)=7⋅6=42\binom{7}{2} = 7 \cdot 6 = 42
✓ (72)=7⋅62!=21\binom{7}{2} = \dfrac{7 \cdot 6}{2!} = 21

Reading it as a fraction

✗ (84)=84=2\binom{8}{4} = \dfrac{8}{4} = 2
✓ it is a count, not a quotient: 8⋅7⋅6⋅524=70\dfrac{8 \cdot 7 \cdot 6 \cdot 5}{24} = 70