Combinations Versus Permutations
Combinations and permutations address similar questions but yield different answers because they treat order differently.
- Combinations: Selections where the order of chosen items is irrelevant. Choosing 3 people for a committee from 10 candidates produces one combination regardless of selection sequence.
- Permutations: Arrangements where the order matters. Awarding gold, silver, and bronze medals to 10 competitors generates different permutations based on who receives which medal.
This distinction is crucial: the same set of objects counted as a combination will always yield a smaller number than when counted as a permutation, because multiple orderings collapse into a single combination.
The Combinations Without Repetition Formula
The standard formula calculates how many ways you can choose r items from n distinct objects when order is irrelevant and each object appears at most once.
C(n,r) = n! ÷ (r! × (n − r)!)
C(n,r)— The total number of possible combinations without repetitionn— The total count of distinct objects available to choose fromr— The sample size, or how many objects you're selecting!— Factorial: the product of all positive integers up to that number (e.g., 5! = 5 × 4 × 3 × 2 × 1 = 120)
Worked Example: Selecting Four Numbers from Ten
Imagine you want to know how many unique 4-digit combinations can be formed using digits 0–9, where each digit appears only once.
Step 1: Identify your variables. You're choosing 4 numbers (r = 4) from 10 available digits (n = 10).
Step 2: Apply the formula.
C(10,4) = 10! ÷ (4! × 6!)
= 3,628,800 ÷ (24 × 720)
= 3,628,800 ÷ 17,280
= 210
Therefore, exactly 210 distinct combinations exist. This is substantially fewer than permutations, which would account for all possible orderings.
Common Pitfalls and Practical Considerations
Avoid these mistakes when calculating or interpreting combinations without repetition.
- Confusing 'no repetition' with 'no replacement' — 'No repetition' means each item appears at most once in any single combination. You're not drawing with or without replacement in the probability sense; rather, you're simply counting selections where duplicates don't exist within that selection.
- Forgetting that order doesn't matter — If you accidentally swap two items and think you've created a new combination, you haven't. Only the membership of the set matters. Verify this by checking whether your problem asks 'how many ways' or 'in how many orders'—the latter signals permutations.
- Exceeding the constraint n ≥ r — You cannot choose more items than are available. If <em>r</em> > <em>n</em>, the result is mathematically undefined (zero combinations exist). Always validate that your sample size doesn't exceed your population.
- Mishandling large factorials — Factorials grow explosively. Computing 50! directly causes overflow in simple calculators. Use this tool or logarithm properties to handle large numbers, or express results in scientific notation.
When Combinations Without Repetition Matter
This concept appears across many domains:
- Lottery design: Calculating odds of winning requires knowing the exact number of possible combinations.
- Genetics: Determining genetic variation when selecting alleles from a population.
- Software testing: Estimating test cases needed to cover all combinations of features without redundant testing.
- Sampling: In quality control, choosing items for inspection from a batch of fixed size.
- Team formation: Counting ways to assemble groups of fixed size from a candidate pool.
In each case, the absence of order and the absence of repetition create a specific combinatorial structure that this formula precisely captures.