Count the ways to choose r items from n when order does not matter. Results are exact, even with thousands of digits. Type item names to see the actual combinations listed.
C(n, r) = n! ÷ (r!(n − r)!) · with repetition: C(n + r − 1, r)
Example: a 5-card poker hand from a 52-card deck: C(52, 5) = 2,598,960.
Where combinations appear
- Lotteries: choosing 6 numbers from 49 gives C(49, 6) = 13,983,816 possible tickets.
- Probability: the binomial formula uses C(n, x) to count the arrangements of x successes.
- Teams and committees: choosing 4 people from 12 gives C(12, 4) = 495 possible teams.