What is a Combination Calculator?
A combination calculator (nCr calculator) counts how many ways you can choose r items from n when the order of the chosen items does not matter. Without repetition it uses the combination formula C(n, r) = n! / (r!(n − r)!); with repetition it uses C(n + r − 1, r). For example, 10 choose 3 = 120. This calculator returns the exact whole number for n up to 10,000, shows the steps and can list every combination.
What the Combination Calculator does
Combinations answer “how many different groups?” questions: lottery tickets, poker hands, committees, handshakes, pizza toppings, test questions to answer. Two selections that contain the same items count once, however the items are listed. The result is also called the binomial coefficient, written nCr, ⁿCᵣ, C(n, r) or (n choose r), and read “n choose r”. That is why the same tool goes by many names: an nCr calculator (n C r calculator), an n choose r or n choose k calculator, a binomial coefficient calculator or a combinatorics calculator.
The calculator works with exact integer arithmetic, so even C(10000, 5000), a number with 3,009 digits, is computed without rounding. Small results are shown in full; for large ones you get scientific notation in the headline and the exact digits underneath. The step-by-step solution cancels the factorials the way you would by hand, a full row of Pascal’s triangle puts your answer in context for n ≤ 30, and ticking List every combination writes out each possible selection, using your own item names if you type them in.
How to use the Combination Calculator
- Enter the Total number of items, n: how many distinct things you can choose from.
- Enter the Number chosen, r: how many items are in each selection.
- Tick Allow repetition only if the same item can be picked more than once (selection with replacement).
- Tick List every combination to see each selection, and type the item names separated by commas if you want them in the list.
- Read the number of combinations, its digit count and scientific notation, and open the steps to see the factorials cancel.
Combination formula (nCr formula)
The nCr formula starts from permutations. There are n × (n − 1) × … × (n − r + 1) = n! / (n − r)! ordered ways to pick r items. Each unordered group of r items shows up r! times in that count, once for every order, so dividing by r! leaves the number of combinations.
| Symbol | Meaning |
|---|---|
| n | number of distinct items available |
| r | number of items in each selection (some books use k) |
| n! | n factorial, n × (n − 1) × … × 2 × 1, with 0! = 1 |
| C(n, r) | also written nCr, ⁿCᵣ, C(n, k) or (n choose r) |
Without repetition r cannot exceed n, and C(n, r) = 0 when it does. With repetition r can be any size, because each item can be reused.
Definitions follow standard references: Binomial coefficient, Wolfram MathWorld and NIST Digital Library of Mathematical Functions, §26.3.
Worked example: lottery odds with 6 from 49
How many tickets in a 6-from-49 lottery?
Problem. A lottery draws 6 numbers from 1 to 49, and the order of the draw does not matter. How many different tickets are possible, and what is the chance that one ticket wins the jackpot?
- 01Order does not matter and numbers cannot repeat, so use C(49, 6) = 49! / (6! × 43!).
- 02Cancel 43!: C(49, 6) = (49 × 48 × 47 × 46 × 45 × 44) / (6 × 5 × 4 × 3 × 2 × 1).
- 03Numerator: 10,068,347,520. Denominator: 720.
- 0410,068,347,520 / 720 = 13,983,816.
Answer. There are 13,983,816 possible tickets, so a single ticket has a 1 in 13,983,816 chance (about 7.1511 × 10⁻⁸) of matching all six numbers.
Why 0! = 1, and other special cases
The factorial of zero is defined as 0! = 1. It is not an arbitrary rule: there is exactly one way to arrange zero objects (do nothing), and the definition keeps the combination formula working at the edges. With 0! = 1, C(n, 0) = n! / (0! · n!) = 1 and C(n, n) = n! / (n! · 0!) = 1, which matches the counting: one way to choose nothing, one way to choose everything.
The symmetry property C(n, r) = C(n, n − r) says that picking r items to keep is the same as picking n − r items to leave out. It is why 10 choose 7 equals 10 choose 3 (both 120), and why the calculator always cancels the larger factorial and multiplies the shorter product.
| Case | Value | Why |
|---|---|---|
| C(n, 0) | 1 | One way to choose nothing |
| C(n, n) | 1 | One way to choose every item |
| C(n, 1) | n | Any single item can be the one chosen |
| C(n, 2) | n(n − 1) / 2 | Number of pairs, such as handshakes or matches |
| C(n, r) with r > n | 0 | Not enough distinct items to choose from |
| Sum of C(n, r) over all r | 2ⁿ | Every subset of n items, of every size |
Combination word problems
Handshake problem. Ten people meet and everyone shakes hands with everyone else once. A handshake is a pair of people, and the pair (Ann, Ben) is the same as (Ben, Ann), so the count is 10 choose 2 = (10 × 9) / 2 = 45 handshakes. In general, n people make n(n − 1) / 2 handshakes.
Committee problem. A club of 12 members must choose a committee of 4. The roles are the same, so order does not matter: C(12, 4) = (12 × 11 × 10 × 9) / 24 = 495 committees. If the club has 5 women and 7 men and the committee must have 2 of each, choose each part separately and multiply: C(5, 2) × C(7, 2) = 10 × 21 = 210 committees.
At least one condition. How many of those 495 committees include at least one woman? Count the complement, committees with men only, and subtract: C(7, 4) = 35, so 495 − 35 = 460. Subtracting the “none” case is usually faster than adding up every “at least one” case.
Sandwich or pizza options. A sandwich shop offers 8 toppings and you choose any 3 different ones: C(8, 3) = 56 sandwiches. If you may take double portions of a topping, repetition is allowed and the count becomes C(10, 3) = 120.
Combinations vs permutations
Ask whether rearranging the chosen items gives a different outcome. If it does not (a hand of cards, a committee), count combinations. If it does (a race finish, a PIN, president and treasurer), count permutations with the Permutation Calculator. Every combination of r items corresponds to r! permutations, so permutations are always at least as numerous.
| Question | Order matters? | Count | Value for n = 10, r = 3 |
|---|---|---|---|
| Pick 3 toppings from 10 | No | C(10, 3) | 120 |
| Award gold, silver, bronze to 3 of 10 runners | Yes | P(10, 3) | 720 |
| Pick 3 scoops from 10 flavours, repeats allowed | No | C(12, 3) | 220 |
| Set a 3-digit code using digits 0–9 | Yes, with repeats | 10³ | 1,000 |
Combinations with repetition (stars and bars)
When items can repeat, picture each selection as a row of r stars (the chosen items) split into n groups by n − 1 bars (one group per item type). Choosing 3 scoops from 8 flavours is a row of 3 stars and 7 bars, so the count is the number of ways to place 3 stars among 10 positions: C(10, 3) = 120. That is why the formula becomes C(n + r − 1, r).
Common n choose r values
Values people look up most often. Enter any other pair above to get the exact answer with steps.
| n choose r | Value | n choose r | Value |
|---|---|---|---|
| 2 choose 1 | 2 | 12 choose 2 | 66 |
| 3 choose 1 | 3 | 13 choose 3 | 286 |
| 3 choose 2 | 3 | 15 choose 4 | 1,365 |
| 3 choose 3 | 1 | 20 choose 3 | 1,140 |
| 4 choose 1 | 4 | 21 choose 2 | 210 |
| 4 choose 2 | 6 | 25 choose 5 | 53,130 |
| 5 choose 3 | 10 | 26 choose 2 | 325 |
| 5 choose 4 | 5 | 30 choose 3 | 4,060 |
| 9 choose 3 | 84 | 35 choose 12 | 834,451,800 |
| 10 choose 2 | 45 | 50 choose 3 | 19,600 |
| 10 choose 3 | 120 | 52 choose 5 | 2,598,960 |
| 10 choose 4 | 210 | 100 choose 2 | 4,950 |
| 10 choose 5 | 252 | 339 choose 4 | 540,597,876 |
| 12 choose 4 | 495 | 500 choose 2 | 124,750 |
nCr on a calculator, in Excel and in code
The nCr key on a scientific calculator is the combination function, and nPr is the permutation function. On a TI-83 or TI-84, type n, press MATH, move right to PRB, choose nCr, type r and press ENTER. On most Casio models nCr sits above the division key and is reached with SHIFT.
| Tool | Without repetition | With repetition |
|---|---|---|
| Excel and Google Sheets | =COMBIN(n, r) | =COMBINA(n, r) |
| Python | math.comb(n, r) | math.comb(n + r − 1, r) |
| R | choose(n, r) | choose(n + r − 1, r) |
| TI-84 | n nCr r | n + r − 1 nCr r |
Common use cases
- Lotteries and games: the number of possible tickets or card hands, and so the probability of any one of them.
- Probability problems: counting favourable and total outcomes, and the coefficients in the binomial distribution and the hypergeometric distribution.
- Team and committee selection: how many different groups of a given size can be formed, and with the list option, which ones.
- Experimental design and testing: the number of pairs or subsets to compare, such as C(k, 2) pairwise comparisons among k groups.
- Menu and product options: bundles, toppings or features where the order of choice is irrelevant.
Assumptions and limitations
- All n items are treated as distinct. If some items are identical (for example letters in a word with repeated letters), the count needs a multinomial formula instead.
- The calculator accepts n and r up to 10,000. Results can have thousands of digits; beyond 300 digits only the first and last 60 are printed.
- The list of combinations is shown only when there are at most 1,000 of them; the count itself has no such limit.
- A count of outcomes becomes a probability only when every outcome is equally likely, as with a fair lottery draw.
- If order matters, use the Permutation Calculator; for the factorials themselves, use the Factorial Calculator.
Frequently asked questions
What does nCr mean?
What is the nCr formula?
How do I know whether to use a combination or a permutation?
What is 10 choose 2?
What is 3 choose 3, and why is C(n, 0) equal to 1?
What happens when r is larger than n?
How many possible combinations are there, and can I see a list of them?
How many 5-card poker hands are there?
What is the formula for combinations with repetition?
Can this calculator handle very large numbers?
Cite this page
Statculator. (2026, November 14). Combination Calculator. Retrieved November 14, 2026, from https://statculator.com/probability/combination-calculator/