How it works
nCr = n! ÷ (r! (n − r)!)
Combinations ignore order: choosing A, B, C is the same as choosing C, B, A. That is why nCr is the number of permutations nPr divided by r!, the number of ways to order the chosen items.
Worked example
A committee of 3 is chosen from 10 people. How many committees are possible? 10C3 = 10! ÷ (3! × 7!) = (10 × 9 × 8) ÷ (3 × 2 × 1) = 120. Five-card poker hands from a 52-card deck: 52C5 = 2,598,960.
What are the odds in a 6-from-49 lottery?
In a draw where you pick 6 numbers from 1–49, only the set of numbers matters, not the order they come out. The number of possible tickets is 49C6 = 13,983,816. One ticket therefore has a 1 in 13,983,816 chance of matching all six.
The same idea counts smaller prizes. To match exactly 5 of the 6, you need 5 of the 6 winning numbers and 1 of the 43 losing ones: 6C5 × 43 = 258 tickets.
Combinations with repetition
Sometimes an item can be picked more than once, like scoops of ice cream in a cup. Then the count is:
C(n + r − 1, r) = (n + r − 1)! ÷ (r! (n − 1)!)
Here is why. Picture 3 scoops as 3 stars and split 5 flavors with 4 bars, so a pattern like ★★|★||| means two of flavor 1 and one of flavor 2. Every cup is one way to place 3 stars among 7 slots, which is C(7, 3) = 35. Without repeats there are only 5C3 = 10 cups. To use the calculator above, enter n + r − 1 as n. For a shop with 31 flavors, that gives C(33, 3) = 5,456 three-scoop cups.
Pizza toppings work the same way. Three different toppings from a menu of 8 gives 8C3 = 56 pizzas. If double portions are allowed, it is C(10, 3) = 120.
Does order matter? A quick test
Swap two of the chosen items. If the result is now different (a podium, a PIN, a seating plan), use permutations. If nothing changes (a team, a hand of cards, a set of toppings), use combinations. Watch the word "combination lock": the order of the digits matters and digits can repeat, so a 4-digit lock with digits 0–9 has 104 = 10,000 settings.
Pascal's triangle
Each number in Pascal's triangle is the sum of the two above it. In symbols, C(n, r) = C(n − 1, r) + C(n − 1, r − 1). For example, 10C3 = 9C3 + 9C2 = 84 + 36 = 120. Row 4 of the triangle is 1, 4, 6, 4, 1, which lists 4C0 to 4C4.
Common mistakes
- Using nPr to count groups. 10P3 = 720 counts each group of 3 people 3! = 6 times, and 720 ÷ 6 = 120.
- Working out three huge factorials on a basic calculator. Cancel first: 52C5 = (52 × 51 × 50 × 49 × 48) ÷ 120.
- Forgetting that repeats change the formula. Use C(n + r − 1, r) when an item can be picked again.
Tips
- nCr = nC(n − r): choosing 3 to keep is the same as choosing 7 to leave out.
- nC0 = nCn = 1.
- On the main calculator, type 10C3 or use the nCr key.
Questions
What is the difference between combinations and permutations?
Combinations ignore order (a team); permutations count order (a ranking). nPr = nCr × r!.
What is 10 choose 3?
120.
Can r be bigger than n?
No. You cannot choose more items than there are, so nCr needs 0 ≤ r ≤ n.
What does nCr mean on a calculator?
It means the number of ways to choose r items from n different items when order does not matter. It is the same value as "n choose r" and C(n, r), which are all names for the binomial coefficient n! ÷ (r! (n − r)!).
How do I count combinations when repeats are allowed?
Use C(n + r − 1, r). For 3 scoops from 5 flavors with repeats, enter n = 7 and r = 3 to get 35.
What are the chances of winning a 6-from-49 lottery?
There are 49C6 = 13,983,816 possible tickets, so one ticket has a 1 in 13,983,816 chance of matching all six numbers.
Sources
- NIST Digital Library of Mathematical Functions, §26.3 Lattice Paths: Binomial Coefficients. Eq. 26.3.1 (definition and meaning of the binomial coefficient), Eq. 26.3.5 (Pascal's rule). Checked 22 November 2026.