##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
((n-1)! arrangements)
For n distinct objects in a circle, the count is (n-1)!.
Why? Fix one person in place (to break rotational symmetry), then arrange the remaining n-1 people.
Example: 5 people around a table. (5-1)! = 4! = 24 unique circular arrangements.
This is always n!/n = (n-1)!, dividing out the n rotations.
