Quick guide
How to use this calculator
- Enter the number of distinct objects.
- Treat rotated copies as the same arrangement.
- Read the exact circular-permutation count.
Calculation method
Fix one object to remove rotational duplicates
Once one object is fixed as an anchor, the remaining n−1 distinct objects may be ordered freely.
Worked example
Seat six people around a table
Rotating everyone together does not create a new relative seating order.
(6−1)! = 120
Supported inputs
Precision and limits
Discrete domain
Inputs are whole counts. Negative, fractional, grouped, and scientific-notation inputs are rejected.
Exact integers
Results use arbitrary-precision integers and are never rounded. Inputs and output size are bounded to keep the page responsive.
Reflection
Clockwise and counterclockwise orders are distinct. Mirror-equivalent necklaces require a different model.
