Overview

Count the number of ways to choose a group of items when order doesn't matter, such as a hand of cards or a committee.

Enter the total number of items, n, and how many you choose, r.

Worked examples

InputsResult
Total Items (n)52Items Chosen (r)5Combinations C(52, 5): 2,598,960
Show 2 more examples
Total Items (n)10Items Chosen (r)3Combinations C(10, 3): 120
Total Items (n)49Items Chosen (r)6Combinations C(49, 6): 13,983,816

Combinations by items chosen

With the calculator's starting values, the combinations C(52, 5) is 2,598,960. The table shows how it changes with the items chosen.

Items Chosen (r)Combinations
322,100
4270,725
5starting value2,598,960
620,358,520
7133,784,560

Other inputs: Total Items: 52 n. Change them in the calculator above for your own numbers.

How it works

Combinations count groups where order doesn't matter: C(n, r) = n! ÷ (r! × (n − r)!). Each item can be chosen once. It's calculated with logarithms so large values don't overflow, and very large results are approximate.

The formula

C(n, r) = n! ÷ (r! (n − r)!)

Practical tips

  • Choosing 5 cards from 52 gives 2,598,960 possible hands.
  • C(n, r) is the same as C(n, n − r).
  • If order matters, use permutations, which are r! times bigger.

Frequently asked questions

Combination or permutation?

If swapping two choices gives the same outcome, it's a combination.

What about repeated choices?

Use combinations with repetition, C(n + r − 1, r).

How many 5-card poker hands are there?

C(52, 5) = 2,598,960.