Combinations Formula Calculator
Choosing three students from a class of ten sounds like a tiny decision. Yet there are 120 different trios hiding inside that one class. Choosing five cards from a deck hides nearly 2.6 million possible hands. Selection problems explode in size far faster than intuition expects.
The calculator above counts such selections exactly. You enter the total number of items, called n, and how many you choose, called r. It returns the number of combinations, written C(n, r). Order never matters in these counts, so each group is counted once and only once.
This page builds the idea from the ground up. Two worked examples show the arithmetic behind small and large answers. Later sections contrast combinations with permutations, reveal a symmetry shortcut, and answer the questions learners ask most. By the end, the formula will feel like an old friend.
What a Combination Counts
A combination is a selection of items where order means nothing. Picking apples labelled A, B, and C gives one combination. Naming the same apples as C, B, A changes nothing at all. The group is identical, so the count treats it as a single outcome.
Committees, lottery tickets, and card hands all work this way. A poker hand of five cards is the same hand in any dealing order. A committee of three students does the same work in any arrangement. Whenever the group matters and the sequence does not, combinations provide the count.
Contrast that with a podium finish at a race. First, second, and third place make order the whole point there. Reordering the same three runners produces a different result. Such ordered counts are called permutations, and they always outnumber the combinations hiding beneath them.
Daily life constantly asks which model fits. A salad built from five toppings is a combination. A playlist of five songs is not, since playing order changes the experience. Training yourself to spot the difference is half the skill.
The Combinations Formula Explained
The formula reads C(n, r) equals n factorial divided by r factorial times (n minus r) factorial. A factorial multiplies a whole number by every positive whole number below it. Five factorial, written 5!, equals 5 times 4 times 3 times 2 times 1, which is 120.
At first glance the formula looks heavy. Mercifully, most of it cancels before any real multiplying begins. The (n minus r) factorial in the denominator wipes out the lower stretch of n factorial. What survives is a short product of r numbers on top. Dividing by r factorial then removes the repeated orderings of the chosen group.
That division step is the heart of the whole method. Choosing r items one by one creates r factorial different orders for the same group. Every group suffers the same overcounting, so one division fixes them all. The formula is really just careful bookkeeping about order.
A Brief History of Counting Combinations
Mathematicians have counted selections for well over a thousand years. Ancient Indian scholars studied how poetic metres combine long and short syllables. Their work produced early versions of the same patterns we use today. The counting problem clearly fascinated people long before modern probability existed.
The famous triangle of values took shape across several cultures. Chinese mathematician Yang Hui published it in the thirteenth century. Blaise Pascal later explored its structure so deeply that his name attached to it in Europe. Pascal also exchanged letters with Pierre de Fermat about gambling problems. Those letters founded probability theory, with combination counts at their core.
How to Use the Combinations Formula Calculator
- Count the total items available and enter that number as n.
- Decide how many items each selection must contain.
- Enter that choice size as r in the second box.
- Press Calculate and read the exact number of combinations.
- Check that r stays no larger than n before calculating.
Worked Example 1: Choosing a Team of Three
The Inputs
A teacher must pick three students from a class of ten for a project team. Every student is equally available, and the team has no internal ranking. Here n equals 10 and r equals 3. Order inside the team does not matter at all.
The Calculation
The formula gives 10 factorial divided by 3 factorial times 7 factorial. Cancelling the 7 factorial leaves 10 times 9 times 8 on top. That product equals 720. Dividing 720 by 3 factorial, which is 6, gives exactly 120.
The Result
The teacher faces 120 possible teams. That number surprises most people, who guess far lower. Ten students feel like a small group until you count their subgroups. Small selections from modest pools already produce three-digit answers.
Worked Example 2: Counting Five-Card Poker Hands
The Inputs
A standard deck holds 52 cards. Each poker hand takes five of them, in any order. Here n equals 52 and r equals 5. Counting these hands is the classic combinations problem found in every probability course.
The Calculation
Cancelling leaves 52 times 51 times 50 times 49 times 48 on top. That product equals 311,875,200. The denominator is 5 factorial, which equals 120. Dividing 311,875,200 by 120 produces the final count. Every step uses whole numbers with no rounding anywhere.
The Result
The exact answer is 2,598,960 possible hands. Nearly 2.6 million hands flow from one ordinary deck. This single number powers most poker probability calculations. Knowing it explains why specific strong hands appear so rarely at the table.
Combinations Versus Permutations
Permutations count arrangements where order carries meaning. Picking a president, a secretary, and a treasurer from ten people is a permutation problem. Swapping who holds which office creates a genuinely different outcome. The count of such arrangements is P(10, 3), which equals 720.
Notice how 720 compares with the 120 teams from the first example. The ratio between them is exactly 6, which is 3 factorial. Every unordered trio can be arranged in six orders. Dividing the permutation count by those six orders collapses it into the combination count. This relationship lets you convert between the two ideas freely.
Choosing the right model is the most common student error. Ask one question before reaching for any formula. Would rearranging the same items create a different result? Answering yes points to permutations, while no points to combinations. Combination locks, confusingly, are permutations in disguise, since their order matters completely.
Symmetry: Choosing r or n Minus r
Every selection secretly makes two choices at once. Picking 5 items from 20 also picks the 15 left behind. Both viewpoints must give the same count. The formula honours this, so C(20, 5) and C(20, 15) both equal 15,504.
Smart calculators exploit this symmetry to work faster. When r exceeds half of n, they compute with n minus r instead. The shorter product gives the identical answer with fewer steps. The tool above uses this shortcut behind the scenes on large inputs. It is also handy for checking your own work by hand.
Symmetry reaches its extreme at the middle of the row. Choosing 30 from 60 is the largest case this calculator accepts. Its exact value is 118,264,581,564,861,424, an eighteen-digit giant. No tidy shortcut exists there, only honest arithmetic.
The same mirror pattern shapes Pascal's triangle, mentioned in the questions below. Values rise toward the middle of each row, then fall in perfect reverse. Once you see the mirror, misreadings become much easier to catch.
Combinations When Repetition Is Allowed
Some selections let the same item appear more than once. Choosing three scoops from five ice cream flavours is the classic puzzle. Without repetition, the flavours give C(5, 3), which equals 10 possible cups. Allowing repeats adds cups like double chocolate with vanilla.
Repetition problems use a shifted formula. The count becomes C(n plus r minus 1, r), a pattern teachers call stars and bars. For the ice cream, C(7, 3) equals 35 possible cups. That is more than triple the no-repeat answer. Always establish whether repeats are allowed before choosing a formula. The calculator above handles the standard no-repetition case, which covers most real problems.
Where Combinations Show Up in Real Life
Lotteries are the most famous everyday example. Drawing 6 numbers from 49 gives C(49, 6), which equals 13,983,816. That figure is why jackpots survive so many rollovers. Each ticket quietly competes against nearly fourteen million rival selections.
Genetics uses combinations to count possible pairings of gene variants. Tournament organisers count possible match schedules with the same formula. Quality inspectors sample items from a batch and count possible samples. Even pizza menus hide combinations, since each topping subset forms one possible pizza. Anywhere groups form without order, this count is quietly running the show.
Computer scientists lean on these counts when judging algorithms. A program checking every possible subset faces combination-sized workloads. Password policies also use the logic when estimating guessing difficulty. The formula sets realistic expectations in all these fields before anyone writes code or buys a ticket.
Probability Starts With Counting
Nearly every probability question hides two combination counts. The denominator counts all possible outcomes. The numerator counts the outcomes you actually want. Dividing the second by the first gives the probability. Cards make the pattern easy to see.
Consider being dealt five hearts from a full deck. The favourable hands number C(13, 5), which equals 1,287. The total hands number 2,598,960, as computed earlier. Dividing gives roughly 0.0005, or about one chance in two thousand. Combination counts quietly power every such answer in the probability chapter.
How Exact Arithmetic Protects Big Answers
Ordinary calculators store numbers with about fifteen reliable digits. Any answer longer than that quietly rounds at the tail. Display screens then switch to powers-of-ten shorthand, hiding the true figure. For many tasks that rounding is harmless. For counting problems, an inexact count is simply a wrong count.
The calculator above multiplies and divides in careful whole-number steps instead. Every intermediate result stays an exact integer, so nothing drifts. The final answer carries all eighteen digits when the problem demands them. Teachers checking homework can trust each digit equally. That precision is the main reason to use a dedicated tool over a general calculator.
Tips for Counting Selections Correctly
- Ask whether order matters before touching any formula at all.
- Use the symmetry shortcut whenever r is more than half of n.
- Sanity-check tiny cases by listing the groups on paper first.
- Remember that choosing none or choosing all always gives one.
- Write big answers in full to avoid silent rounding mistakes.
Frequently Asked Questions
General Questions
1. What is a combination?
A combination is a selection of items where the order does not matter. Choosing three friends for a trip counts once, however you list their names. The calculator above counts how many such selections exist. Give it the pool size and the group size.
2. What is the combinations formula?
The formula is C(n, r) equals n factorial divided by r factorial times (n minus r) factorial. It starts from ordered selections and divides away the repeated arrangements. Each symbol has a simple meaning. Here n is the total pool and r is the group size.
3. What does the exclamation mark mean?
The mark denotes a factorial, a product of descending whole numbers. Four factorial means 4 times 3 times 2 times 1, which equals 24. Factorials grow extremely fast as numbers rise. Zero factorial is defined as 1 by convention.
4. How is a combination different from a permutation?
Permutations care about order, while combinations ignore it completely. A podium finish is a permutation, but a committee is a combination. Because each group can be arranged several ways, permutations always number more. Dividing by r factorial converts one count into the other.
5. What does C(10, 3) mean in plain words?
It asks how many groups of three can be formed from ten items. The answer is 120 different groups. Order inside each group is ignored entirely. This notation appears in textbooks, probability courses, and the calculator above.
How the Calculation Works
6. Why does the formula divide by r factorial?
Ordered picking counts every group many times over. A group of r items can be arranged in r factorial different orders. Dividing removes those duplicates evenly. What remains is one count per genuine group.
7. What is C(n, 0) or C(n, n)?
Both always equal exactly 1. Choosing nothing from a pool can happen in only one way. Choosing everything is equally unique. These boundary cases anchor the whole pattern of values. The calculator returns 1 for both without complaint.
8. Why does C(20, 5) equal C(20, 15)?
Choosing 5 items automatically leaves 15 unchosen. Every selection pairs with exactly one leftovers group. Counting selections or counting leftovers must therefore agree. Both values equal 15,504 in this case.
9. How many five-card poker hands exist?
A 52-card deck produces C(52, 5) hands. Working through the formula gives 2,598,960 distinct hands. Every poker probability starts from this denominator. Rare hands stay rare because the total is so large.
10. How many ways can lottery numbers be drawn?
A draw of 6 numbers from 49 allows C(49, 6) outcomes. That equals 13,983,816 possible selections. One ticket covers exactly one of them. The arithmetic explains why jackpots roll over so often.
Practical Questions
11. Can r be bigger than n?
No, you cannot choose more items than the pool contains. The calculator rejects such entries with an error message. Check for a swapped n and r when this happens. Most real mistakes are simple typing slips.
12. Why do the numbers grow so fast?
Each extra item multiplies the possibilities rather than adding to them. Doubling the pool can multiply the count by thousands. Choosing half of 60 items already passes a hundred quadrillion. Growth this steep is called combinatorial explosion.
13. Does the calculator give exact answers for big inputs?
Yes, it computes with whole-number arithmetic that carries every digit. Ordinary calculators round long results into scientific notation. Here C(60, 30) appears in full as 118,264,581,564,861,424. Nothing is shortened or approximated.
14. Where are combinations used in real life?
Lotteries, card games, and committee choices are the obvious homes. Sampling plans in factories rely on them for quality checks. Genetics, tournament scheduling, and menu design all use the same count. Any grouping task without order qualifies.
15. What is Pascal's triangle and how does it connect?
It is a triangular array where each entry adds the two above it. Every entry equals a combination count for its position. Row ten contains 1, 10, 45, 120, and their mirrors. Blaise Pascal's pattern gives the same answers by pure addition.
CONCLUSION
Combinations turn vague feelings about choice into exact counts. The formula looks dense, yet it rests on one friendly idea: divide away the orderings that do not matter. Whether you face 120 student teams or millions of poker hands, the same two inputs drive the answer. Enter your n and r into the calculator above, and let exact arithmetic replace guessing the next time a selection problem lands in front of you. Keep the symmetry and order checks in mind as well. Together they catch most counting mistakes before they happen.