What Is a Combination? Counting Selections Where Order Does Not Matter
By the BrainSnail editorial team. How these articles are written and checked, and how to tell us when one is wrong.
Choosing three people from ten for a committee and choosing three for first, second and third place are different counting problems. The difference is whether order matters, and getting that wrong is the commonest error in elementary probability.
The distinction
A permutation is an arrangement in which order matters, so selecting three people and assigning them to distinct roles gives a different result depending on who takes which role. A combination is a selection in which order does not matter, so a committee of three is the same committee however the members are listed. The relationship between the two is direct, since every combination of three can be arranged in six different orders, so the number of permutations is the number of combinations multiplied by the number of arrangements of the selected items. That gives the standard formula, which divides the count of ordered selections by the number of orderings to remove the duplication. Recognising which situation applies is the entire difficulty, and the test is simply whether swapping two of the chosen items produces a different outcome.
Where each applies
The two arise in recognisably different situations:
- •Lottery numbers are a combination, since the draw is the same set however it is ordered
- •A podium finish is a permutation, since first and second are different outcomes
- •A poker hand is a combination, since the cards are held rather than ordered
- •A password or a lock code is a permutation despite the common name, since the order is essential
- •Choosing a subcommittee is a combination, and choosing a chair and a secretary from it is a permutation
- •Dealing cards to distinct players mixes the two, which is why such problems require care
The triangle
The counts of combinations arrange themselves into a triangular pattern in which each entry is the sum of the two above it, and that structure carries a surprising amount. The rows give the coefficients that appear when a two-term expression is raised to a power, which is why the same numbers turn up in algebra and in counting, and the connection is not a coincidence, since expanding such a power amounts to choosing how many factors contribute each term. The triangle also encodes the probabilities of outcomes when a fair two-sided event is repeated, which produces the familiar bell-shaped distribution as the number of repetitions grows. Individual diagonals give the counting numbers, the triangular numbers and further sequences. The pattern was known independently in several mathematical traditions well before the European mathematician it is usually named after.
Why it matters for probability
Counting is the foundation of elementary probability and errors in the count propagate directly into wrong answers. Where all outcomes are equally likely, a probability is the count of favourable outcomes divided by the count of possible ones, so both counts must use the same convention about order. Mixing them, counting favourable outcomes as ordered and possible ones as unordered or the reverse, produces an answer wrong by a factor that can be enormous. Card and dice problems are the standard teaching ground precisely because the conventions are easy to get wrong. The lottery calculation is a useful illustration, since the number of possible draws is a combination and the resulting probability is small enough to be worth seeing written out, which does more to convey the odds than any verbal description.
Where the counting gets hard
Real problems rarely present themselves as clean selections and the complications are worth recognising. Repetition changes everything, since choosing with replacement allows the same item more than once and needs a different formula. Indistinguishable items reduce the count, since arrangements that differ only by swapping identical items are not different arrangements. Constraints that certain items must or must not appear together require either subtracting the disallowed cases or counting the allowed ones directly, and choosing which approach is easier saves considerable work. Overlapping conditions need a systematic method for adding and subtracting cases so that nothing is counted twice or missed. The general advice from people who teach this is to describe the selection process in words precisely, decide at each step whether order matters and whether repetition is allowed, and only then reach for a formula.
The takeaway
Order matters in a permutation and does not in a combination, and the test is whether swapping two chosen items changes the outcome. Dividing the ordered count by the number of orderings removes the duplication, which is the formula. The counts form a triangle where each entry is the sum of the two above, and the same numbers give binomial coefficients and the bell-shaped distribution.