Permutations vs Combinations: Does Order Matter?

The entire distinction between a permutation and a combination comes down to one question: does the order of selection matter for what you're counting? Arranging three books on a shelf cares about order (a permutation); choosing three books to take on a trip does not (a combination).

Because permutations count every distinct ordering as a separate outcome, the permutation count for choosing r items from n is always larger than the combination count for the same selection — specifically larger by a factor of r! (r factorial), which is exactly how many ways those r chosen items could be arranged among themselves.

A frequent real-world mix-up: a lottery where you pick numbers is a combination problem (order of picking does not change whether you win), while a race's top-three finishing positions is a permutation problem (1st, 2nd and 3rd place are distinct even with the same three people) — same "choose 3 from n" setup, different formula, very different resulting count.

1. Does Order of Selection Matter?

In combinatorics and probability theory, the fundamental decision between permutations and combinations hinges on a single question: **Does the sequence or order of arrangement matter?** - **Permutations (Order Matters):** Different arrangements of the same elements constitute distinct outcomes. Locker combinations, race finish rankings (1st, 2nd, 3rd), phone numbers, and anagrams are permutations. - **Combinations (Order Does NOT Matter):** The grouping or selection is identical regardless of the order items were drawn. Poker hands, lottery numbers, committee member selections, and salad ingredients are combinations.

2. Factorials and The Mathematical Governing Equations

Both calculations rely on factorials (`n! = n × (n-1) × ... × 1` with `0! = 1`): - **Permutations of n items taken r at a time (nPr):** `nPr = n! / (n - r)!` - **Combinations of n items taken r at a time (nCr):** `nCr = n! / [ r! × (n - r)! ] = nPr / r!` Notice the extra `r!` in the combination denominator: dividing by `r!` eliminates duplicate groupings that differ only by their internal ordering.

3. Worked Comparison: 3 People Chosen from 10 Candidates

Consider a pool of 10 qualified job candidates: - **Scenario A (Permutation):** Selecting a CEO, CTO, and CFO (roles matter): `10P3 = 10! / (10 - 3)! = 10! / 7! = 10 × 9 × 8 = 720 possible officer slates`. - **Scenario B (Combination):** Selecting 3 equal members for a review committee: `10C3 = 10! / [ 3! × 7! ] = (10 × 9 × 8) / (3 × 2 × 1) = 720 / 6 = 120 possible committees`. There are six times fewer combinations because selecting [Alice, Bob, Carol] is identical to selecting [Carol, Alice, Bob] when committee titles are equal.

4. The Locker Combination Misnomer

Everyday language frequently uses these terms inaccurately. A 'combination lock' is mathematically a **permutation lock**: if your dial code is 14-32-08, entering 32-14-08 will not open the lock because sequence matters. Calling it a combination lock is a classic linguistic misnomer.

5. Frequently Asked Questions on Permutations and Combinations

What is the formula for permutations with repetition? When items can be reused (like a 4-digit PIN where digits 0-9 repeat), the formula is `n^r` (e.g. `10^4 = 10,000 PIN combinations`). ### How does Pascal's Triangle relate to combinations? The entry in row n and column r of Pascal's Triangle corresponds exactly to the binomial coefficient `nCr`. ### How do circular permutations differ from linear permutations? Arranging n distinct items in a closed circle has `(n - 1)!` permutations, because rotational shifts do not create distinct relative arrangements.

6. Strategic Takeaways

Before writing probability equations, ask whether swapping the order of two chosen elements creates a brand-new scenario. If yes, compute permutations (`nPr`); if no, divide by factorials using combinations (`nCr`).