Permutations and Ordered Arrangements

Core Idea

A permutation is an ordered arrangement of objects where the sequence matters. The number of permutations of n distinct objects taken r at a time is P(n,r) = n!/(n-r)!. Permutations count the ways to select and arrange r items from n items when order is significant.

How It's Best Learned

Use visual representations like seating arrangements, password creation, or race rankings. Compare small cases (2–3 objects) and count manually before deriving the formula.

Common Misconceptions

• Confusing permutations with combinations (order matters in permutations!).
• Misapplying the factorial formula.
• Not reducing n!/(n-r)! correctly.

Explainer

A permutation is what you get when order matters. From the multiplication principle — your prerequisite — you already know that sequential independent choices multiply. Permutations are exactly that pattern applied to the specific situation of selecting and arranging items from a set without replacement.

Imagine you're assigning 3 trophies (gold, silver, bronze) to 3 of 8 runners in a race. The gold medal choice has 8 options, the silver has 7 (one runner already took gold), and the bronze has 6. The total is 8 × 7 × 6 = 336. This is P(8, 3): 8 people, choosing 3, where the order of selection (who gets which medal) matters. The general formula P(n, r) = n!/(n-r)! captures exactly this "dwindling slot" pattern: you multiply from n down to n-r+1, which is the same as n! divided by the (n-r)! that you're *not* using.

The factorial n! = n × (n-1) × (n-2) × … × 1 represents the special case where r = n: arranging *all* n items. If you have 5 books to arrange on a shelf, the first slot has 5 choices, the second has 4, and so on: 5! = 120 arrangements. As n grows, factorials explode — 10! = 3,628,800 — which is why exact counting with permutations is more tractable than brute enumeration.

The crucial conceptual boundary is the distinction between permutations and combinations. Permutations count arrangements where order matters. If you're assigning runners to medals, (Alice-gold, Bob-silver) is different from (Bob-gold, Alice-silver). But if you're just selecting 3 runners for *any* podium recognition without distinguishing the prizes, those two selections count as the same group. That's the combinations side of the coin. Any time you're counting permutations but suspect order shouldn't matter, ask yourself: would swapping two chosen items give a genuinely different outcome? If not, you need combinations instead.