Overview
A combination counts how many ways you can choose items from a group when order doesn't matter, such as lottery numbers or a committee. Each item can only be chosen once.
Enter the total number of items, n, and how many you choose, r.
Worked examples
| Inputs | Result |
|---|---|
| Total Items (n)30Items Chosen (r)6 | Combinations C(30, 6): 593,775 |
Show 3 more examples
| Total Items (n)49Items Chosen (r)6 | Combinations C(49, 6): 13,983,816 |
| Total Items (n)10Items Chosen (r)3 | Combinations C(10, 3): 120 |
| Total Items (n)52Items Chosen (r)5 | Combinations C(52, 5): 2,598,960 |
Combinations by items chosen
With the calculator's starting values, the combinations C(30, 6) is 593,775. The table shows how it changes with the items chosen.
| Items Chosen (r) | Combinations |
|---|---|
| 3 | 4,060 |
| 4 | 27,405 |
| 5 | 142,506 |
| 6starting value | 593,775 |
| 7 | 2,035,800 |
| 8 | 5,852,925 |
| 9 | 14,307,150 |
Other inputs: Total Items: 30 n. Change them in the calculator above for your own numbers.
How it works
The count is n! ÷ (r! × (n − r)!). It's calculated with logarithms, so large values don't overflow, then rounded. If order matters, use permutations instead, which are bigger by a factor of r!.
The formula
| n | Total items to choose from |
| r | Number chosen |
Practical tips
- Choosing 6 from 30 gives 593,775 combinations.
- A 6-from-49 lottery has 13,983,816 combinations.
- C(n, r) equals C(n, n − r). Choosing 2 to leave out is the same as choosing 28 to keep.
Frequently asked questions
What's the difference between combinations and permutations?
Combinations ignore order, so ABC and CBA are the same. Permutations count them separately.
What does 'without repetition' mean?
Each item can be picked only once, as with drawing names from a hat.
How big can the numbers get?
Very large results lose exact precision, so treat anything above about 9 quadrillion as approximate.