Circular Permutations: Concepts, Formulas and Examples
A circular permutation is an arrangement of objects around a circle — such as people seated at a round table — where only relative positions matter. Rotating the whole arrangement does not create a new one, because every person still has the same neighbours on the left and right.
This matters because round-table seatings, garlands, and necklaces are genuinely different from row seatings: a rotation that looks "new" on paper is the same arrangement in reality, so the counting formula must remove those duplicate rotations.
Key Concepts
- Relative position: in a circle, what matters is who sits next to whom, not absolute seats.
- Rotation equivalence: rotating all objects together gives the same circular arrangement.
- Reference fixing: fixing one object in place removes the n duplicate rotations.
- Flippable arrangements: necklaces and garlands can be turned over, making clockwise and anticlockwise the same.
Formulas
- Round table: (n − 1)! ways to arrange n distinct objects in a circle.
- Flippable (necklace/garland): (n − 1)! / 2 ways, since each arrangement and its mirror image are identical.
- Derivation: fix one object, then arrange the remaining n − 1 in a line relative to it: (n − 1)!.
Worked Example
In how many ways can 6 people sit around a round table? Fix one person, say A, in a seat to remove the rotations. The remaining 5 people can be arranged in the 5 seats relative to A in 5! = 120 ways. So there are (6 − 1)! = 120 seatings. Compare with a straight row of 6 chairs, which would give 6! = 720 — the circle has exactly 6 times fewer because each circular seating was counted 6 times as rotations in the row count.
Common Misconceptions
- "Use n! for a circle." Wrong — n! counts rotations as different. The correct count is (n − 1)!.
- "Divide by 2 for every circular problem." Wrong — the extra division by 2 applies only when the arrangement can be flipped over, like a necklace, not for people around a table.
- "Fixing any object always works." Right, but remember why: fixing one object kills the rotational symmetry, which is exactly what makes the circle different from a row.
Real-World Applications
- Round-table seating at dinners, meetings, and conferences.
- Necklaces, garlands, and bracelets made from distinct beads or flowers.
- Key rings and circular dials where rotation does not change the design.
- Tournament scheduling around a circular table.
Circular permutations count relative arrangements: (n − 1)! for a round table, halved when flipping is allowed. Fix one object to break the rotational symmetry, arrange the rest, and the answer is exact.
Related blogs
- Fundamental Principle of Counting: Explained with Examples
- Factorial Notation: Concepts, Formulas and Examples
- Permutations: Arrangements and Factorial Formula Guide
- Permutations with Repetitions: Repeated Items Formula
- Combinations: Explained with Examples, Concepts and Examples
- nPr and nCr Relations: Formulas, Proofs & Examples