Circular Permutation

Circular Permutation deals with arranging distinct objects around a circle (or any closed loop). Unlike linear arrangements, rotations of the same circular arrangement are considered identical because there is no fixed starting point. The number of ways to arrange 'n' distinct objects around a circle is (n-1)!.

10Worksheets
200+Practice Questions
IntermediateDifficulty
2-3 hoursHours to Master

Introduction to Circular Permutation

Circular Permutation deals with arranging distinct objects around a circle (or any closed loop). Unlike linear arrangements, rotations of the same circular arrangement are considered identical because there is no fixed starting point. The number of ways to arrange 'n' distinct objects around a circle is (n-1)!.

Prerequisites

Linear permutation basics Understanding of rotational symmetry Factorial concept
Why This Matters: Circular Permutation problems appear in 1-2 questions in SSC CGL and Banking exams. They test understanding of rotational symmetry.

How to Solve Circular Permutation Problems

1

Step 1: Identify that arrangement is circular (round table, circle, etc.)

2

Step 2: Determine if clockwise and anticlockwise arrangements are considered different

3

Step 3: For arrangements where rotations are considered the same: use (n-1)!

4

Step 4: For arrangements where reflections are also considered the same (necklaces): use (n-1)!/2

5

Step 5: For arrangements with restrictions (specific persons together), treat the group as a unit

6

Step 6: Fix one object's position to break the circular symmetry

7

Step 7: Arrange the remaining (n-1) objects in (n-1)! ways

Pro Strategy: To break rotational symmetry, fix one person's position. Then arrange the remaining (n-1) people in (n-1)! ways. This works because fixing one person eliminates all rotations that would otherwise be counted as distinct.

Example Problem

Example: In how many ways can 6 people be seated around a circular table? Solution: Step 1: Arrangement is circular (rotations are considered same) Step 2: Clockwise and anticlockwise are considered different Step 3: Use formula: (n-1)! = (6-1)! = 5! Step 4: 5! = 5 × 4 × 3 × 2 × 1 = 120 Answer: 120 ways

Pro Tips & Tricks

  • Circular permutations: (n-1)! when rotations are considered same
  • If reflections are also considered same (necklaces, bracelets): (n-1)!/2
  • For arrangements around a circle with a marked position, use n! (the mark breaks symmetry)
  • For seating problems with restrictions, fix the restricted person first
  • When treating a group as a unit in circular arrangements, arrange the unit in the circle first
  • Remember: In a circle, there's no natural 'first' position

Shortcut Methods to Solve Faster

Number of circular arrangements = (n-1)!
Number of necklace arrangements = (n-1)!/2 (for n ≥ 3)
If clockwise = anticlockwise, divide by 2
For n = 1: 1 way; n = 2: 1 way; n = 3: 2 ways

Common Mistakes to Avoid

Using n! instead of (n-1)! for circular arrangements
Forgetting that rotations are considered identical
Not considering whether reflections count as different
Applying circular permutation formula when arrangement is actually linear

Exam Importance

Circular Permutation is an important topic for various competitive exams. Here's how frequently it appears:

SSC CGL
1-2 questions
BANKING PO
1-2 questions
RAILWAYS RRB
1-2 questions
CAT
1-2 questions
INSURANCE
1-2 questions

Ready to Master Circular Permutation?

Start with Worksheet 1 and work your way up to expert level! Each worksheet includes:

20 practice questions
Detailed solutions
Step-by-step explanations
Start Practicing Now