Circular Permutation – From Intuition to Precision
Imagine you have four friends – A, B, C, D – and you want to seat them around a round table. How many different seating arrangements are possible?
If they were sitting in a straight line, the answer would be 4!=24. But a round table is different. Why? Because a circle has no fixed "start" or "end". If everyone stands up, rotates one seat to the left, and sits down again, the arrangement looks the same – each person still has the same neighbours on either side. In a line, shifting everyone one place to the right gives a completely different arrangement.
This is the core intuition: in a circular arrangement, rotations of the same relative order are considered identical. Only the relative positions matter, not the absolute seat number.
The Precise Statement
For n distinct objects arranged around a circle, the number of distinct circular permutations is:
Why (n−1)! and not n!? Because for every circular arrangement, there are n linear arrangements that correspond to it (one for each possible "starting point" if you cut the circle at a different seat). So we divide the linear count by n:
nn!=(n−1)!
Number of circular permutations of n distinct objects=(n−1)!
A Concrete Example
Take 3 distinct objects: X, Y, Z.
- Linear permutations: 3!=6 → XYZ, XZY, YXZ, YZX, ZXY, ZYX
- Circular permutations: (3−1)!=2!=2
Which two? If you list them around a circle, you'll find that XYZ, YZX, and ZXY are all the same circle (just rotated). Similarly, XZY, ZYX, and YXZ are the same circle. So only two distinct circles exist.
To quickly count circular permutations, fix one object in place (to break the rotational symmetry) and then arrange the remaining n−1 objects in the usual linear way. That gives (n−1)! directly.
When Direction Matters: Necklaces and Bracelets
If the circle can be flipped over (like a necklace or a bracelet), then arrangements that are mirror images also count as the same. This is called a circular permutation with reflection symmetry (or a "necklace problem").
For n distinct objects, the number of distinct arrangements when flipping is allowed is:
2(n−1)!
This works only for n>2. For n=1 or 2, the formula needs separate handling (there's only 1 arrangement in each case).
Do not apply the (n−1)! formula when the objects are not all distinct (e.g., some identical beads on a necklace). That requires a different approach using division by factorial of repetitions, and the circular symmetry makes it trickier.
Summary
| Situation | Formula | Why? |
|---|
| n distinct objects around a circle (rotations same) | (n−1)! | Fix one object, arrange the rest linearly |
| n distinct objects on a necklace (rotations + flips same) | 2(n−1)! (for n>2) | Also identify mirror images |
The key takeaway: circular permutation is linear permutation divided by the number of rotations that leave the arrangement unchanged. That number is always n for a circle of n distinct objects.