Combination Calculator
Work out how many different groups of r items can be chosen from a set of n items when the order of selection does not matter.
| Combinations C(n, r) | 13,983,816 |
|---|---|
| Combinations with repetition | 25,827,165 |
| Chance of one specific combination | 1 in 13,983,816 |
Link to this calculation – copied!
Formula
With repetition: C(n + r − 1, r)
| Symbol | Meaning |
|---|---|
| n | Total number of items to choose from |
| r | Number of items chosen |
| ! | Factorial, e.g. 5! = 5 × 4 × 3 × 2 × 1 |
How to Use This Calculator
- Enter the Total items (n).
- Enter the Items chosen (r).
- Press Calculate. Results also update automatically as you type.
Worked Example
Using the values pre-filled in the calculator above:
| Total items (n) | 49 |
|---|---|
| Items chosen (r) | 6 |
| Combinations C(n, r) | 13,983,816 |
|---|---|
| Combinations with repetition | 25,827,165 |
| Chance of one specific combination | 1 in 13,983,816 |
About This Calculation
A combination is a selection in which order does not matter. Choosing Alice, Ben and Chloe for a committee is the same committee as choosing Chloe, Alice and Ben, so it is counted once. The number of combinations, written C(n, r), "n choose r" or nCr, is also called the binomial coefficient because the same numbers appear in the expansion of (a + b)n and in Pascal's triangle.
The classic example is a lottery. Picking 6 numbers from 49 gives C(49, 6) = 13,983,816 possible tickets, so a single ticket has roughly a 1 in 14 million chance of matching every number. Combinations also count poker hands, pizza topping choices, and the number of ways to pick a sample from a population.
If the same item can be chosen more than once, such as picking 3 scoops of ice cream from 10 flavors where two scoops can be the same flavor, use combinations with repetition, C(n + r − 1, r). If order does matter, for example ranking finishers or forming a PIN, you need permutations instead, which are always at least as numerous.
Frequently Asked Questions
- What is the difference between a combination and a permutation?
- Combinations ignore order and permutations count it. Choosing 3 people for a team is a combination; awarding gold, silver and bronze to 3 people is a permutation.
- Why is C(n, 0) equal to 1?
- There is exactly one way to choose nothing: the empty selection. Likewise C(n, n) = 1 because there is only one way to take every item.
- How are combinations used in probability?
- They count equally likely outcomes. The binomial probability calculator multiplies C(n, k) by the probability of each specific arrangement of successes.