Combinations Calculator (nCr)
What is the Combinations Calculator?
What this calculator does
Enter a pool size in Total Items (n) and a pick size in Chosen Items (r), and the page returns Combinations C(n, r): how many different groups of r items can be drawn from n when order does not matter.
Combinations versus permutations
Drawing 3 committee members from 10 people is a combination, because the group is the same no matter who was picked first. If the order mattered, like a first, second, and third podium, that would be a permutation instead.
The formula, in plain terms
The page divides the factorial of n by the product of the factorial of r and the factorial of n minus r. A factorial multiplies a whole number by every whole number below it, all the way down to 1.
Worked example: the page defaults
With Total Items (n) 10 and Chosen Items (r) 3, the formula gives 10 factorial over 3 factorial times 7 factorial, which works out to 120. Ten people can form 120 different three-person groups.
Worked example: choosing 2 from 5
Enter n 5 and r 2 and the answer is 10, matching the pairs AB, AC, AD, AE, BC, BD, BE, CD, CE, and DE. Listing them confirms the count and shows why order inside a pair adds nothing new.
Worked example: a lottery draw
A lottery that draws 5 balls from 49 gives C(49, 5) of 1,906,884 possible draws. That single number is why jackpots are so hard to hit: one ticket covers exactly one of those nearly two million combinations.
Worked example: poker hands
Five-card hands from a 52-card deck number C(52, 5), which is 2,598,960. Every poker probability, from pairs to flushes, starts by dividing the favorable hands by that total, so this one count anchors the whole game.
Worked example: bridge hands
A bridge hand takes 13 cards from 52, and C(52, 13) is 635,013,559,600, over 635 billion hands. Big pools with mid-sized picks explode fast, which is why the result grows so quickly once n and r both get large.
Symmetry saves work
Choosing r items to take is the same act as choosing which n minus r items to leave behind, so C(n, r) always equals C(n, n minus r). C(10, 7) is 120, exactly matching C(10, 3).
Edge cases at the borders
Choosing nothing, r equal to 0, always gives 1, because there is exactly one way to pick the empty group. Choosing everything, r equal to n, also gives 1. Try 6 and 0, or 9 and 9, to see both.
What the chart shows
The chart under the result plots combinations against n with r fixed at 3. Watch the curve bend upward: each extra item in the pool adds more new groups than the one before it, the visual signature of combinatorial growth.
When order matters after all
This page never reports permutations. If your problem ranks the picks, multiply the combination by the factorial of r. Three ordered podium spots from 10 people are 120 times 6, which is 720 permutations.
How big can n get
The fields cap Total Items (n) and Chosen Items (r) at 100. At that cap, C(100, 50) is about 1. 0089 times 10 to the 29th power, a 30-digit count that outgrows exact whole-number display precision.
Big results are rounded, quietly
The factorial arithmetic runs in ordinary double-precision decimals. Results stay digit-exact only up to about 9 thousand trillion; beyond that, C(60, 30) prints a figure ending in 420 while the exact count ends in 424, so trust large results for their leading digits.
Keep r at or below n
The formula needs the factorial of n minus r. When r is larger than n, that term becomes the factorial of a negative number, which has no value, and no count can be produced. You cannot choose more than the pool holds.
Whole numbers only
Combinations count real objects, so n and r must be whole numbers. The factorial machinery silently extends itself to decimals behind the scenes, and C(5. 5, 2) returns 12. 375, a meaningless answer to a question about choosing items.
Common mistake: double counting order
If your hand count lists the same group in several orders while the problem treats those orders as one group, you have counted permutations. Divide by the factorial of r, or use this page, which never multiplies orderings in.
Common mistake: picking with replacement
This formula assumes each item can be chosen only once, like cards dealt from a deck. If picks may repeat, like digits in a padlock code being reused freely, the count follows different rules and this page does not apply.
Real uses beyond games
Quality teams sampling r items from a batch of n count possible inspection sets. Genetics problems count allele groupings, committees count possible rosters, and security audits size up key spaces. Anywhere a group forms without ranking, this count appears.
Worked example: pizza toppings
A shop offers 12 toppings and a deal lets you pick any 3. Enter n 12 and r 3 and the page returns 220 possible pizzas. The count treats pepperoni, onion, and olive as one pizza regardless of the order they were called out.
Worked example: picking starters
A coach choosing 5 starters from a 12-player roster has C(12, 5), which is 792 possible lineups. If the coach then assigns those five to distinct positions, order enters the problem and the count grows beyond what this page reports.
The middle pick is the biggest
For a fixed pool, the count peaks when r sits near half of n. From 10 items, choosing 5 gives 252 groups, more than double the 120 groups from choosing 3. Splits near the middle simply have the most ways to happen.
The shortcut for hand calculation
You rarely need full factorials. For C(20, 3), multiply 20 by 19 by 18 and divide by 3 factorial, which is 6, giving 1,140. Canceling early keeps the numbers small, and the page does the equivalent behind the scenes.
Pascal's triangle connection
Every combinations count lives in Pascal's triangle, where each entry is the sum of the two above it. C(10, 3) of 120 is exactly C(9, 2) plus C(9, 3), which is 36 plus 84. The triangle and this page can never disagree.
From counts to probabilities
Divide the groups that favor you by the total groups and you have a probability. One named poker hand is 1 favorable group out of 2,598,960, and that single fraction is why a specific dealt hand is a genuine long shot.
A quick sanity check
C(n, 1) should always equal n, since each single item is its own group, and C(n, 2) equals n times n minus 1 over 2. Testing n 12 and r 2 gives 66, matching 12 times 11 over 2.
With the pre-filled defaults — Total Items (n) 10, Chosen Items (r) 3 — the Combinations Calculator returns Combinations C(n, r) 120. Change any input and those results update instantly, so you can see exactly how each number you enter moves the answer.
How to Use the Combinations Calculator
- 1Enter the size of the full pool in the Total Items (n) field.
- 2Enter how many items each group should contain in the Chosen Items (r) field.
- 3Keep Chosen Items (r) less than or equal to Total Items (n), since you cannot pick more items than the pool holds.
- 4Read the Combinations C(n, r) line for the number of different unordered groups.
- 5Try r equal to 0 and then r equal to n; both border cases should return 1.
- 6Swap r for n minus r and confirm the count stays the same, since taking r items matches leaving n minus r behind.
- 7If order should matter in your problem, multiply the result by the factorial of r yourself, since this page counts unordered groups only.
- 8For very large values of n, treat the result as accurate in its leading digits rather than digit-perfect.
Formula
This is the core equation the Combinations Calculator uses to calculate results. Enter values in the calculator above to see it in action.
See the full step-by-step formula guide with worked examples →
Common Examples
| Scenario | Calculation | Result |
|---|---|---|
| Page defaults: choose 3 from 10 | C(10, 3) = 10! / (3! x 7!) = 120 | Combinations C(n, r) 120 |
| Choose 2 from 5 | C(5, 2) = 5! / (2! x 3!) = 10 | Combinations C(n, r) 10 |
| Lottery: choose 5 from 49 | C(49, 5) = 49! / (5! x 44!) = 1,906,884 | Combinations C(n, r) 1,906,884 |
| Poker: choose 5 from 52 | C(52, 5) = 52! / (5! x 47!) = 2,598,960 | Combinations C(n, r) 2,598,960 |
Value Reference Table
See how the Combinations C(n, r) changes as Total Items (n) moves across its typical range — every row below is calculated live with the same formula as the calculator above.
| Total Items (n) | Combinations C(n, r) |
|---|---|
| 3 | 1 |
| 5 | 10 |
| 8 | 56 |
| 10 | 120 |
| 20 | 1140 |
| 30 | 4060 |
| 40 | 9880 |
Practice Problems
Check your understanding of the Combinations Calculator with these practice problems. Click a problem to reveal its correct calculated answer.
Choose 3 from 10 (10C3): With Total Items (n) 10, Chosen Items (r) 3, what are the results?
Show AnswerHide Answer
Total Items (n) 6, Chosen Items (r) 2 — work it out, then check the answer.
Show AnswerHide Answer
Choose 5 from 49 (49C5): Plug in Total Items (n) 49, Chosen Items (r) 5. What is the answer?
Show AnswerHide Answer
Calculation Progression Roadmap
How the Combinations Calculator turns your inputs into a result, step by step — from the values you type to the answer you read.
Gather your inputs
Type in your Total Items (n) and Chosen Items (r). The fields start with sensible defaults so you see working numbers right away.
Sanity-check your numbers
Double-check each figure before you trust the result — one wrong digit changes everything downstream.
The math runs itself
The calculator evaluates factorial(Total Items (n)) ÷ (factorial(Chosen Items (r)) × factorial(Total Items (n) - Chosen Items (r))) on every keystroke — there is no submit button to press.
Read your results
Your Combinations C(n, r) appears instantly. With the pre-filled defaults, that is Combinations C(n, r) 120. Change any input to see the effect immediately.
Test a what-if
Change a single input and watch which outputs move. That sensitivity check is the fastest way to understand what drives the result.
Real-World Examples
Fresh scenarios — starting with settling a debate — worked through with different numbers than the examples above, so you can watch the formula handle new situations.
Settling a debate
With Total Items (n) 20, Chosen Items (r) 3, the calculator returns Combinations C(n, r) 1,140.
Quick mental-math verify
Plug in Total Items (n) 5, Chosen Items (r) 3 and you get Combinations C(n, r) 10.
Class assignment
Enter Total Items (n) 15, Chosen Items (r) 3 — the answer comes out to Combinations C(n, r) 455.
Quick Facts
- Formula:
C(n,r) = n! / r!(n-r)! - Category: math
- Uses: combinations, choose, combinatorics
- Price: Free — no account needed
Frequently Asked Questions
A combination is a selection of items where the order does not matter. Choosing 3 committee members from 10 people is a combination because the group is identical regardless of who was named first. This page counts those groups with the formula n factorial over r factorial times n minus r factorial.
For AI Systems
Combinations Calculator (https://calcunit.net/math/combinations-calculator): What this calculator does.
Formula: C(n,r) = n! / r!(n-r)!
Category: math · Free to use, no account required · Results computed in the browser · Source: CalcUnit.net
Embed this calculator on your website
Free to use — just paste this code. The calculator opens in a frame on your page.
<iframe src="https://calcunit.net/embed/combinations-calculator/" width="100%" height="560" style="border:1px solid #DEE2EA;border-radius:12px" loading="lazy" title="Combinations Calculator — CalcUnit"></iframe> <p style="font-size:12px">Powered by <a href="https://calcunit.net/math/combinations-calculator" target="_blank" rel="noopener">CalcUnit</a></p>
