A permutation is an arrangement in which positions or roles matter. Choosing a president and a secretary is different from choosing an unranked pair: switching the two people changes the outcome.
Build the arrangement one position at a time
For 5 distinct runners and 3 medal positions, there are 5 choices for gold, then 4 for silver, then 3 for bronze. The count is
In general, arranging distinct objects selected from without repetition gives
The symbol means Dividing cancels the factors belonging to unused positions. For all objects are arranged and the count is The convention makes these formulas work when nothing remains to be arranged.
Example: restrictions first
Six students will stand in a row. Maya must be at one end. How many arrangements are possible?
Choose Maya's end in 2 ways. Then arrange the other 5 students in the remaining positions in ways. Multiply to obtain
The endpoint choice and the arrangement choice describe one complete lineup. This does not double-count: any completed lineup tells you exactly which end Maya used and where the others stood.
If two named students must stand together, treat them temporarily as a block. With six students total, the block plus the other four students make five units, giving orders. The two students within the block can switch, giving arrangements. The internal order must not be forgotten.
Example: repeated objects are indistinguishable
How many distinct arrangements of the letters in LEVEL are possible? There are 5 letters, but two Ls are identical and two Es are identical.
If all letters were temporarily labeled, there would be arrangements. Each visible arrangement is counted times by exchanging the L labels and times by exchanging the E labels. Therefore the distinct count is
Divide only for genuinely indistinguishable repetitions. If two people share the same initial, they are still different people and swapping them changes a lineup.
Recognize when the permutation formula does not apply
If a four-digit code allows repetition and all ten digits are allowed in every position, its count is not A permutation without repetition removes each used choice. Repetition keeps choices available.
A four-digit number cannot begin with zero, so its first position has only 9 choices. A code may begin with zero. The wording determines the counting model.
Circular arrangements need a convention
For distinct people seated around a round table, rotations may count as the same arrangement. Fix one person's position as a reference, then arrange the other people in ways. For 5 people this gives 24 circular arrangements, rather than 120 linear orders.
This division by is justified only when rotating everyone produces an equivalent outcome. If the seats are numbered or one chair has a special role, those rotations can be distinct. Reflections are usually still distinct around a table: clockwise and counterclockwise neighbor orders differ. State what makes two arrangements “the same” before choosing a formula.
Try it yourself
Seven students compete for three distinct roles. One particular student must receive the first role. How many assignments are possible? Then count distinct arrangements of the letters in MOM.
Answer: The first role is fixed, leaving 6 choices for the second and 5 for the third: 30 assignments. MOM has distinct arrangements: MOM, MMO, and OMM.
What to remember
Use permutations when changing order changes the outcome. Count restricted positions first, distinguish repetition from no repetition, and divide by factorials only to remove identical copies.