DS
May 16, 2026
How many ways to arrange n distinct objects in a circle? (Circular permutations)
I understand that for arranging distinct objects in a line, there are ways. But for a circle, the answer is . Why?
For example, with 4 people at a round table:
- Rotational symmetry means arrangements that differ only by rotation are considered the same
- So
But what if the circle has a fixed reference point (like numbered seats)? Does it become again?
Also, what about arrangements of beads on a necklace where flipping over is also considered the same (dihedral symmetry)? Does the count become ?
2 answers395 views
Loading comments...
2 Answers
RF
Robert FischerMay 16, 2026 Accepted**Linear vs circular arrangements:**
For $n$ distinct objects in a line: $n!$ arrangements.
In a circle, rotations of the same arrangement are considered identical. Since there are $n$ possible rotations for each arrangement: $n!/n = (n-1)!$.
**With fixed reference points (numbered seats):** The rotations become distinct because each seat is identifiable. So it's back to $n!$. This is a good example of how the "symmetry" of the problem changes the count.
**Necklaces (dihedral symmetry):** If the arrangement can be flipped over (reflection symmetry), we divide by 2 more:
For $n \geq 3$: $(n-1)!/2$ distinct necklaces.
**Example:** With 3 distinct beads:
- Linear: 6
- Circular: 2
- Necklace: 1 (the two circular arrangements are mirrors of each other)
**General formula:**
- Distinct objects in a circle: $(n-1)!$
- Distinct objects at a round table with labeled seats: $n!$
- Distinct beads on a necklace: $(n-1)!/2$ for $n > 2$
Loading comments...
LW
Lisa WangMay 16, 2026A real-world application of circular permutations: seating arrangements for a round-table negotiation.
If 8 diplomats sit at a round table with no head position, there are $7! = 5040$ distinct arrangements. But if we care about who sits next to whom (for alliance-building), we need to consider pairs.
**Number of handshakes:** With $n$ people at a round table, there are $n(n-3)/2$ possible handshakes (each person can shake hands with $n-3$ non-adjacent people).
**Problem variation:** If 3 particular diplomats must not sit together, how many arrangements? Count the complement: treat the 3 as a block, then arrange: $(6-1)! \times 3! = 5! \times 6 = 720$. Subtract from $5040$ to get $4320$ valid arrangements.
Loading comments...