Circular arrangements

Circular arrangement problems count how many ways objects can be placed around a circle. The key idea is that rotations of the same seating or placement are not considered different, because the circle has no fixed starting point.

Main method

1. Count the objects being arranged.
2. Fix one object in a reference position if the objects are all distinct. This removes rotational duplicates.
3. Arrange the remaining objects in the available positions.
4. If there are restrictions, such as two people staying together or certain objects not being adjacent, handle those first by grouping or subtracting unwanted cases.

For distinct objects around a circle, the basic count is often (n-1)! rather than n!, since one object is fixed to eliminate rotations.

If there are repeated objects

If some objects are identical, divide by the factorials of repeated counts just as in ordinary arrangements, then apply the circular idea carefully.

Check your result

• Make sure rotations are not counted multiple times.
• If a restriction is involved, test a small case to see whether your setup matches the condition.
• Simplify the final expression fully.

A good final answer should reflect the circular nature of the arrangement and any special conditions exactly.