Arrangements around a circle where rotations represent the same seating or ordering.
Circular Permutations in plain English
Anchor one person or object to remove rotational duplicates, then arrange the remaining n-1 items. If reflections also count as identical, divide by two—but only when the problem explicitly treats clockwise and counterclockwise orders as the same.