CalConverters

Circular Permutations Calculator

Find the number of ways to arrange n distinct items around a circle — (n−1)! — with the fix-a-reference-point reasoning and a comparison to a straight line.

Loading calculator…

How to use this calculator

Type the number of distinct items n that will sit around a circle — a dinner table, a ring of keys, a cycle in a diagram. The calculator returns (n−1)!(n-1)!, the number of seatings that are genuinely different once rotations are treated as the same arrangement, and shows it next to n!n!, the count you would get if the same items were lined up straight instead.

Tip: Circular permutations reuse the same factorial machinery as ordinary permutations — the only change is fixing one item as a reference point before counting the rest.

What is a circular permutation?

A circular permutation is an arrangement of n distinct items around a closed loop, where two arrangements that are rotations of each other count as one, not two. Sitting Alice-Bob-Carol-Dana around a table and then rotating everyone one seat to the right produces the same seating relative to each other — nobody's neighbors changed — so it shouldn't be counted twice.

Why (n−1)!(n-1)! instead of n!n!

A straight line has a fixed first position and a fixed last position, so choosing who starts the line matters — that's exactly what n!n! counts. A circle has no fixed start or end: there is no seat that is definitively "first." Rotating an entire seating by one position gives back an arrangement that looks identical in every relative sense.

The fix is to remove that rotational freedom before counting:

  1. Fix one item in place as a reference point — it no longer matters which physical seat it occupies, only where everyone else sits relative to it.
  2. Arrange the remaining n−1n-1 items around that fixed point, exactly like arranging them in a line: (n−1)!(n-1)! ways.
(n−1)! circular arrangements, vs. n! in a straight line(n-1)! \text{ circular arrangements, vs. } n! \text{ in a straight line}

Every one of the n!n! straight-line orderings corresponds to exactly nn rotations of the same circular seating, so n!/n=(n−1)!n! / n = (n-1)! — dividing out the rotations is the same move as fixing one seat.

The classic mistake

The most common error (see the source doc's list of common mistakes) is reaching for n!n! out of habit — the formula everyone learns first — and forgetting that a circle has no fixed starting point. For n=6n = 6 that mistake overcounts by a factor of 6: 720720 instead of the correct 120120. Whenever the problem says "around a table," "in a ring," or "in a circle," that's the cue to subtract one from nn before taking the factorial.

A step further — necklaces and bracelets

If the arrangement can also be flipped — a bead necklace looks the same read clockwise or counter-clockwise — then each circular arrangement is counted twice by (n−1)!(n-1)! (once for each direction), so the true count is (n−1)!/2(n-1)!/2. This calculator handles the plain circular case only; treat the necklace/bracelet variant as a follow-up halving once you have (n−1)!(n-1)!.

Worked example — 6 people around a round table

  1. There is no fixed seat, so fix one person in place as the reference point.
  2. The remaining 6−1=56 - 1 = 5 people can be arranged in any order around them.
  3. (6−1)!=5!=5×4×3×2×1=120(6-1)! = 5! = 5 \times 4 \times 3 \times 2 \times 1 = 120.
  4. Compare with a straight line of the same 6 people: 6!=7206! = 720 — exactly 6 times as many, because each of the 120 circular seatings has 6 rotated copies among those 720 line-ups.

So 6 people around a table have 120 distinct circular arrangements.

Frequently asked questions

Why is a circular permutation (n−1)! instead of n!?
A straight line has a fixed first and last position, so swapping which item starts the line creates a genuinely new arrangement — hence n!n!. A circle has no fixed start: rotating every seat over by one gives back the exact same seating. Fixing one item in place as a reference point removes those rotational duplicates, leaving only the remaining n−1n-1 items free to arrange, which is (n−1)!(n-1)!.
How many ways can 6 people sit around a round table?
(6−1)!=5!=120(6-1)! = 5! = 120 ways. In a straight line the same 6 people would have 6!=7206! = 720 orderings — six times as many, one for each rotation of every circular seating.
What is a circular permutation?
It is an arrangement of distinct items around a closed loop (a table, a ring, a cycle) where arrangements that are rotations of each other are counted once, not separately. The formula is (n−1)!(n-1)! for nn distinct items.
What's the classic mistake when counting circular arrangements?
Using n!n! instead of (n−1)!(n-1)! — treating the circle like a line with a fixed starting point. Every circular arrangement corresponds to exactly nn rotated copies in the n!n! count, so dividing by nn (equivalently, fixing one seat) is what gives the correct (n−1)!(n-1)!.
What if the arrangement can also be flipped, like a bead necklace?
When flipping (reflection) also produces an identical-looking arrangement — a necklace viewed from either side, for example — each circular arrangement is double-counted by (n−1)!(n-1)!, so you would divide by 2 to get (n−1)!/2(n-1)!/2. This calculator computes plain circular permutations only; it does not apply the reflection correction.
Does n have to be a whole number?
Yes — n counts distinct physical items (people, beads, charms), so it must be a whole number of 1 or greater. Fractional or negative counts have no seating to arrange.
What's the largest n this calculator can compute?
Up to n = 5000, where (n−1)!(n-1)! already has thousands of digits. Every result uses exact big-integer arithmetic, and results over 15 digits are also shown in scientific notation so they stay readable.

Related calculators