Understanding Combinations
A combination is a selection of items from a larger group where the order of selection is irrelevant. If you choose red, blue, and green balls, it's the same combination as choosing green, red, and blue—the arrangement doesn't change the outcome.
This contrasts sharply with permutations, where sequence matters. Picking red-then-blue-then-green is different from green-then-blue-then-red in a permutation.
Real-world applications include:
- Lottery draws—selecting 6 numbers from 49 regardless of pick order
- Committee selection—choosing 5 people from 12 candidates
- Hand selection in card games—which cards you hold, not the order dealt
- Genetics—combinations of alleles in offspring
The symbol nCr (read "n choose r") represents the number of ways to choose r items from n total items.
Combination Formula
The mathematical foundation for counting combinations without repetition rests on factorial notation. When items cannot be reused, the formula below eliminates the redundant orderings that permutations would count separately.
C(n,r) = n! ÷ (r! × (n−r)!)
With repetition allowed:
C(n+r−1,r) = (n+r−1)! ÷ (r! × (n−1)!)
n— Total number of distinct objects availabler— Number of objects you wish to choose!— Factorial—the product of all positive integers up to that number (e.g., 5! = 5 × 4 × 3 × 2 × 1 = 120)
Combinations vs. Permutations
The core distinction lies in whether arrangement sequence affects the outcome:
- Combinations: Order irrelevant. Choosing {A, B, C} is identical to {C, B, A}. Use when selecting a subset.
- Permutations: Order matters. Sequence ABC differs from CBA. Use when arrangement or ranking is significant.
Converting between them is straightforward: multiply combinations by r! to get permutations (accounting for all possible orderings), or divide permutations by r! to collapse orderings into single combinations.
Example with three coloured balls:
- Permutations: RBG, RGB, BRG, BGR, GRB, GBR = 6 ways
- Combinations: {R, B, G} = 1 way (all arrangements are equivalent)
Repetition in Selections
Standard combination problems assume each item can only be chosen once—you draw a ball and don't return it. However, real scenarios sometimes allow repetition.
With replacement (repetition allowed), you can select the same item multiple times. For instance, when sampling with replacement in statistics, or choosing toppings where unlimited quantities exist, the formula changes to account for these duplicates.
The combination generator in this tool handles both scenarios:
- Without repetition: Each item selected once maximum
- With repetition: Items can appear multiple times in a selection
Repetition dramatically increases the count. Selecting 2 items from 3 objects yields 3 combinations without repetition, but 6 combinations with repetition allowed.
Practical Considerations
Avoid these common pitfalls when calculating combinations:
- Confusing order sensitivity — Always clarify whether arrangement matters. A lottery draw cares only that your numbers appear, not when you selected them. Roster assignments care about which person fills which role—that's permutations.
- Forgetting about repetition rules — Verify whether items return to the pool after selection. Survey sampling without replacement uses combination formulas; sampling with replacement requires adjusted calculations.
- Factorial explosion at large n — Factorials grow extremely fast. 20! exceeds 2 quadrillion. When n and r are both large, the combination value becomes astronomically large or requires scientific notation to express meaningfully.
- Misapplying the formula — Ensure r ≤ n; you cannot select more items than exist in the pool (unless repetition is allowed). Double-check your formula choice matches your selection rules.