What Is a Combination Without Repetition?
A combination without repetition counts the number of distinct groups you can form by choosing r items from a set of n different items, where the order of selection does not matter and no item can be picked more than once. It answers questions like "how many 5-card poker hands exist?" or "how many ways can a committee of 3 be picked from 10 people?"
How to Use This Calculator
Enter the total number of available items as n and the number of items you want to choose as r. The calculator instantly returns \(C(n, r)\), the number of unique combinations. Note that \(r\) cannot exceed \(n\); if it does, the result is 0 because you cannot choose more items than exist.
The Formula Explained
The formula is $$C(n, r) = \frac{\text{n}!}{\text{r}!\,\left(\text{n} - \text{r}\right)!}$$ where "!" denotes a factorial (the product of all positive integers up to that number). The numerator \(n!\) counts every ordered arrangement, while dividing by \(r!\) removes the orderings within the chosen group and dividing by \((n - r)!\) removes the orderings of the items left out. To stay accurate with large numbers, this tool computes the result iteratively instead of evaluating huge factorials directly.
Worked Example
How many ways can you choose 2 toppings from 5? $$C(5, 2) = \frac{5!}{2!\,\cdot\,3!} = \frac{120}{2 \cdot 6} = \frac{120}{12} = \mathbf{10}$$ There are 10 distinct pairs of toppings.
Pascal's Triangle and Common C(n, r) Values
The table lists C(n, r) for n = 0 to 10. Blank cells mean r > n, where no selection is possible (the value is 0).
| n \ r | 0 | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10 |
|---|---|---|---|---|---|---|---|---|---|---|---|
| 0 | 1 | ||||||||||
| 1 | 1 | 1 | |||||||||
| 2 | 1 | 2 | 1 | ||||||||
| 3 | 1 | 3 | 3 | 1 | |||||||
| 4 | 1 | 4 | 6 | 4 | 1 | ||||||
| 5 | 1 | 5 | 10 | 10 | 5 | 1 | |||||
| 6 | 1 | 6 | 15 | 20 | 15 | 6 | 1 | ||||
| 7 | 1 | 7 | 21 | 35 | 35 | 21 | 7 | 1 | |||
| 8 | 1 | 8 | 28 | 56 | 70 | 56 | 28 | 8 | 1 | ||
| 9 | 1 | 9 | 36 | 84 | 126 | 126 | 84 | 36 | 9 | 1 | |
| 10 | 1 | 10 | 45 | 120 | 210 | 252 | 210 | 120 | 45 | 10 | 1 |
- Symmetry: \(C(n,r)=C(n,n-r)\). Choosing which r items to take is the same as choosing which n − r to leave behind. Each row reads the same forwards and backwards.
- Pascal's rule: \(C(n,r)=C(n-1,r-1)+C(n-1,r)\). Each entry is the sum of the two entries directly above it, for example 120 = 36 + 84 in row 10.
- Each row sums to \(2^n\), for example row 10 sums to 1,024.
How to Calculate nCr by Hand
- Use symmetry. Compare r and n − r and work with the smaller one, since \(C(n,r)=C(n,n-r)\). For example, C(50,48) = C(50,2).
- Write r factors descending from n: \(n\cdot(n-1)\cdot(n-2)\cdots(n-r+1)\). This is the numerator.
- Write r! in the denominator: \(r\cdot(r-1)\cdots 2\cdot 1\).
- Cancel common factors before multiplying. Divide numerator terms by denominator terms where they share factors. This keeps the numbers small and the result exact, because the final answer is always a whole number.
- Multiply what remains to get the result.
- Verify with a small case. For C(7,3): \(\frac{7\cdot 6\cdot 5}{3\cdot 2\cdot 1}=\frac{210}{6}=35\). Symmetry check: C(7,4) = \(\frac{7\cdot 6\cdot 5\cdot 4}{24}=35\), which also matches the table above.
FAQ
What's the difference between combination and permutation? A permutation cares about order (AB \(\neq\) BA); a combination does not (AB = BA). Combinations are always fewer than or equal to permutations.
What is \(C(n, 0)\)? It equals 1 — there is exactly one way to choose nothing.
Does "without repetition" matter here? Yes. Without repetition means each item can appear at most once in a group, which is the standard nCr scenario this calculator solves.