Combinations (nCr)

Also known as nCr · how many ways to choose

nCr=(nr)=n!r! (n−r)!{}_{n}C_{r} = \binom{n}{r} = \frac{n!}{r! \, (n-r)!}

Units aren’t used in this calculation — every value is a plain number.

Worked example: C(52,5) = 2598960 poker hands — press Try an example to run it live, then adjust anything.

Enter your known values, leave one input blank, and solves for the missing one. Tap a variable’s symbol to see what it means, with a typical value.

Here the solver did the work — could you?

Counting the ways →

Grade 12Grade 12 Math

Test your skills in the Exam Room: new numbers every attempt — free lessons for students, no sign-up, just pure learning. Find 1 more lesson on this formula.

See your Report Card
Compete with your friends
share your results
Learning zone

Combinations (nCr) explained

rnnCr

A combination counts groups, not orders. Start from the permutations n!/(n−r)! and divide by r!, because each group of r items was counted once for every way of shuffling it. A five-card poker hand from a 52-card deck: 52C5 = 2,598,960. A 6/49 lottery ticket: 49C6 = 13,983,816, which is exactly why the jackpot chance is about 1 in 14 million.

These numbers are the entries of Pascal's triangle, which Pascal himself laid out in the Traité du triangle arithmétique (written 1654, printed 1665) while corresponding with Fermat about how to divide the stakes of an interrupted game — the exchange usually credited with founding probability theory. The triangle was known centuries earlier to Halayudha in India and to Yang Hui in China. Two things to remember: nCr = nC(n−r), so choosing 47 cards to discard is the same job as choosing 5 to keep, and the count has no closed-form inverse, so this calculator solves only for the number of groups.

Combinations (nCr) formula

nCr=(nr)=n!r! (n−r)!{}_{n}C_{r} = \binom{n}{r} = \frac{n!}{r! \, (n-r)!}
Where
  • nCr{}_{n}C_{r}= Number of unordered selections
  • nn= Items available
  • rr= Items chosen

Missing one of these? Work it out first, then come back