Combination Calculator (nCr)
Count how many ways to choose r items from n (order doesn't matter).
Combinations count the number of ways to select a group when the order of selection doesn't matter.
How the Math Works
The Combination Calculator uses the fundamental formula nCr = n! ÷ (r! × (n − r)!) to determine how many unique ways you can select r items from a larger set of n items where order is irrelevant. The calculation works by first computing n! (n factorial), which represents all possible arrangements of n items. We then divide by r! to eliminate the different orderings of the selected items, and by (n-r)! to account for the arrangements of the remaining unselected items. This mathematical approach ensures we count only distinct groups rather than permutations, giving us the true number of combinations possible.
Practical Applications
To apply this calculator, simply enter your total number of items (n) and the number of items you want to select (r) into the respective fields. The calculator will then compute nCr using the formula and return your result instantly. This tool is particularly useful for probability calculations, statistical analysis, and combinatorial problem-solving in academic settings. You can use it to verify manual calculations, explore different scenarios by adjusting your inputs, or solve complex problems that would be time-consuming to calculate by hand.
Day-to-Day Use
Combination calculations appear in many everyday situations, from determining your odds of winning lottery games to selecting the optimal combination of courses for your degree program. When planning events, you might use nCr to figure out how many different ways to arrange seating or choose menu items. Sports analysts use combinations to calculate tournament brackets and playoff scenarios. Even in everyday decision-making, like choosing which restaurants to visit from a list of options, understanding combinations helps you quantify your choices and make more informed decisions.
Worked example
Lottery: choose 6 from 49 → 49C6 = 13,983,816 combinations.
FAQ
Combination vs permutation?
Combinations ignore order; permutations count ordered arrangements (so there are always more permutations).