Circular Permutations Calculator counts the number of distinct ways to arrange n objects around a circle, using the formula (n − 1)!. Because rotating a circular arrangement produces the same physical layout, one position is fixed as a reference before the remaining objects are arranged.
Why circular arrangements divide out a rotation
Arranging n objects in a straight line produces n! distinct orders, but a circle has no fixed starting point, so rotating any circular arrangement by one seat produces the same layout read from a different position.
Fixing one object's seat removes the rotational duplicates, leaving (n − 1) remaining objects to arrange in the other seats: (n − 1)! total distinct circular arrangements.
Work through a seating example
Seating 5 people around a round table gives (5 − 1)! = 4! = 4 × 3 × 2 × 1 = 24 distinct arrangements.
Compare this to seating the same 5 people in a row, which gives 5! = 120 arrangements; the circular count is exactly one-fifth of the linear count, because each of the 5 rotations of a circular layout would otherwise be counted as a separate linear arrangement.
Compute circular permutations as P(n − 1, n − 1)
Circular Permutations Calculator computes (n − 1)! using the same permutation engine as ordinary permutations, entering n − 1 for both the pool size and the selection size: P(n − 1, n − 1) = (n − 1)!.
For 5 seats, that becomes P(4, 4) = 4! = 24, matching the direct circular formula exactly, since selecting and arranging all 4 remaining people after fixing the first seat is the same computation either way.
Distinguish clockwise from mirror-image arrangements
The formula (n − 1)! treats clockwise and counterclockwise arrangements of the same group as distinct, which is standard for seating problems where left and right neighbors are meaningfully different. Some circular problems, such as arranging beads on a bracelet that can be flipped over, also divide by 2 to merge mirror-image arrangements.
Circular Permutations Calculator uses the seating convention, without the extra flip division, since flipping is not a symmetry of a table seating arrangement.
Avoid this common mistake
Applying the ordinary permutation formula n! to a circular arrangement overcounts by a factor of n, since every rotation of a valid layout gets counted as a separate arrangement. For 6 people around a table, 6! gives 720, but the correct circular count is (6 − 1)! = 5! = 120.
Fix one seat as a reference point before counting to avoid this overcounting.
Apply circular permutations to a smaller group
Arranging 3 people around a small round table gives (3 − 1)! = 2! = 2 distinct arrangements. Listing them by fixing person A's seat confirms this directly: with A fixed, B and C can sit in either "B then C" or "C then B" order going clockwise, giving exactly 2 layouts.
This small case is a useful hand-check before trusting the formula on larger groups where listing every arrangement is no longer practical.
Recognize when a problem is circular rather than linear
The key phrase to watch for is a description of objects placed around a closed shape, such as "around a table," "on a ring," or "in a circle," rather than "in a row" or "on a shelf." Whenever a described arrangement has no distinguishable starting or ending position, and rotating the whole layout produces something indistinguishable from the original, the circular formula (n − 1)! applies instead of the linear n!.
Frequently asked questions
What is the formula for circular permutations?
The formula for circular permutations is (n − 1)!, where n is the number of objects arranged around a circle. One position is treated as fixed to remove rotational duplicates.
How many ways can 6 people be seated around a round table?
Six people can be seated around a round table in (6 − 1)! = 5! = 120 distinct ways, after fixing one person's seat as the reference point.
Why is the circular permutation formula (n-1)! instead of n!?
The circular permutation formula is (n − 1)! instead of n! because rotating a circular arrangement produces the same physical layout, so the n rotations of every linear arrangement all count as one circular arrangement, dividing the linear count of n! by n.
Does circular permutation account for flipping the arrangement over?
The standard circular permutation formula (n − 1)! does not account for flipping the arrangement over; it only removes rotational duplicates. Problems involving a bracelet or necklace that can be turned over typically divide the result by 2 as an additional step.
How many ways can 4 keys be arranged on a keyring?
If flipping the keyring over is not allowed, 4 keys arrange in (4 − 1)! = 3! = 6 distinct ways around the ring. If flipping is allowed, divide by 2 for 3 distinct arrangements.
What is the circular permutation of 1 or 2 objects?
The circular permutation of 1 object is (1 − 1)! = 0! = 1, since there is only one way to seat a single object. Two objects give (2 − 1)! = 1! = 1, since swapping the only two seats around a 2-seat circle produces the same relative arrangement.
How many ways can 3 people sit around a table?
Three people can sit around a table in (3 − 1)! = 2! = 2 distinct ways, after fixing one person's seat as the reference point to remove rotational duplicates.
How do you tell a circular arrangement problem apart from a linear one?
A circular arrangement problem describes objects placed around a closed shape with no fixed start or end, using phrases like "around a table" or "on a ring," while a linear arrangement problem describes objects placed "in a row" or "on a shelf" with a clear first and last position.
Summary
Circular Permutations Calculator applies (n − 1)! to count arrangements around a circle, removing the rotational duplicates that a plain n! count would overcount. Seating 5 people gives 24 arrangements rather than 120, one-fifth of the linear total.
Use the ordinary permutation engine with n − 1 in both slots, P(n − 1, n − 1), to compute the same result.