Course contentsShow
← Mathematics
Lesson 2584 of 3,12152. CombinatoricsFree lesson

Circular Permutations

Understand permutations in a circle where rotations are considered identical, using (n-1)! formula.

Circular Permutations

What you'll learn: How to count arrangements of objects around a circle where rotations are considered the same arrangement.

The Key Difference from Linear Permutations

When you arrange objects in a line, every position is unique—there's a first, second, third object, and so on. But when you arrange objects in a circle, there's no fixed starting point. Rotating everyone around the circle doesn't create a new arrangement; it's the same pattern, just viewed from a different angle.

Why (n-1)! Instead of n!

Imagine seating 5 people around a circular table. In a line, you'd have 5! = 120 different arrangements. But in a circle:

  • Pick any person (say, Alice) and fix her position as a reference point. This eliminates the rotation problem—now we're essentially asking "who sits to Alice's right, who next, and so on?"
  • With Alice fixed, you have 4 remaining people to arrange in the remaining positions
  • That's 4! = 24 distinct circular arrangements

The formula: For n distinct objects arranged in a circle, there are (n-1)! unique circular permutations.

The Intuition

Think of it this way: regular permutations of n objects give n! arrangements, but in a circle, every arrangement can be rotated n different ways that all look identical. So we divide by n to avoid counting duplicates: n!/n = (n-1)!

Example

How many ways can 6 people sit around a round table?
Answer: (6-1)! = 5! = 120 ways

Key Takeaway: Circular permutations account for rotational symmetry by fixing one object's position, yielding (n-1)! distinct arrangements for n objects arranged in a circle.