Overview

How many different groups can you make? This counts the combinations of r items chosen from n, where order doesn't matter and nothing repeats.

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

Worked examples

InputsResult
Total Items (n)20Items Chosen (r)4Combinations C(20, 4): 4,845
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(20, 4) is 4,845. The table shows how it changes with the items chosen.

Items Chosen (r)Combinations
2190
31,140
4starting value4,845
515,504
638,760

Other inputs: Total Items: 20 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 4 toppings from 20 gives 4,845 combinations.
  • 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.