0
0

Circular Permutations

Introduction

Circular permutations count the number of ways to arrange objects around a circle where rotations are considered the same arrangement. This appears in seating problems, round-table arrangements, and necklace/bracelet problems (with slight differences).

It's important because many real-world arrangement problems (seating, round-robin layouts) treat rotated arrangements as identical - using linear permutation formulas will overcount unless you adjust for rotational symmetry.

Pattern: Circular Permutations

Pattern

When arranging n distinct objects around a circle and rotations are identical, the number of distinct arrangements is (n - 1)!.

Formula: Total arrangements = (n - 1)! (for n distinct items on a round table, rotations considered the same).

Notes:

  • If reflections (flipping the circle) are also considered identical (e.g., an unlabeled necklace), divide further by 2 → (n - 1)! / 2 for n > 2.
  • If some objects repeat, first treat them as distinct (n!), then divide by repeats and by n for rotations where applicable - handle repeats carefully.
  • Fixing one object in a position (anchor) and permuting the rest is a useful mental model: anchor one → arrange remaining (n - 1)! ways.

Step-by-Step Example

Question

Five friends - A, B, C, D, E - sit around a round table. In how many distinct ways can they be seated if rotations are considered the same?

Solution

  1. Step 1: Identify what is given.

    There are n = 5 distinct people; seating is circular and rotations are identical.
  2. Step 2: Choose the circular permutation rule.

    Use the formula (n - 1)! because rotating all people doesn't create a new arrangement.
  3. Step 3: Substitute and compute.

    (5 - 1)! = 4! = 4 × 3 × 2 × 1 = 24.
  4. Final Answer:

    There are 24 distinct seating arrangements.
  5. Quick Check:

    Anchor friend A at one seat (fix position), then permute remaining 4 friends → 4! = 24 ✅

Quick Variations

1. Reflections identical (necklace): If rotating _and_ flipping are identical, use (n - 1)! / 2 for n > 2.

2. Some positions fixed or labeled: If one or more seats are labeled (e.g., host seat), treat those labels first, then apply linear permutations for remaining seats.

3. Repeated items: For repeats, compute linear arrangements accounting for repeats, then divide by n for rotations (if applicable) - or anchor one distinct item to avoid dividing by n incorrectly.

Trick to Always Use

  • Step 1: Ask: are rotations identical? If YES → use (n - 1)!.
  • Step 2: Ask: are reflections identical? If YES → divide by 2 more (use (n - 1)! / 2 for simple cases).
  • Step 3: Anchor one object (fix it) to convert a circular problem into a linear one and arrange the remaining objects - this avoids mental mistakes.

Summary

Summary

Key takeaways for circular permutations:

  • Use (n - 1)! when arranging n distinct objects around a circle and rotations are considered the same.
  • If reflections are also identical (mirror symmetry), use (n - 1)! / 2 (for n > 2).
  • Anchor one object to simplify counting; handle repeated items or labeled seats carefully to avoid over/under-counting.

Practice

(1/5)
1. How many distinct ways can 4 friends sit around a circular table (rotations considered identical)?
easy
A. 24
B. 12
C. 6
D. 8

Solution

  1. Step 1: Identify the number of people

    Number of people n = 4.
  2. Step 2: State the circular-arrangement formula

    For circular arrangements where rotations are identical, use (n - 1)!.
  3. Step 3: Compute the factorial

    (4 - 1)! = 3! = 6.
  4. Final Answer:

    6 → Option C.
  5. Quick Check:

    Fix one person and arrange the remaining 3 → 3! = 6 ✅
Hint: For circular seating use (n - 1)!, not n!.
Common Mistakes: Using n! instead of (n - 1)! for circular seating.
2. Five people are to be seated around a round table. In how many distinct ways can this be done if rotations are considered the same?
easy
A. 24
B. 120
C. 60
D. 12

Solution

  1. Step 1: Identify n

    n = 5 people.
  2. Step 2: State the circular-arrangement formula

    Circular arrangements (rotations identical) use (n - 1)!.
  3. Step 3: Compute the factorial

    (5 - 1)! = 4! = 24.
  4. Final Answer:

    24 → Option A.
  5. Quick Check:

    Anchor one person, arrange remaining 4 → 4! = 24 ✅
Hint: Subtract 1 from n before taking factorial for circular seating.
Common Mistakes: Multiplying by n! instead of reducing for rotations.
3. In how many distinct ways can 6 friends sit around a round table if clockwise and anticlockwise arrangements are considered different?
easy
A. 720
B. 120
C. 60
D. 20

Solution

  1. Step 1: Identify n

    n = 6 friends.
  2. Step 2: Clarify symmetry condition

    If rotations are identical but reflections (clockwise vs anticlockwise) are considered different, use (n - 1)!.
  3. Step 3: Compute the factorial

    (6 - 1)! = 5! = 120.
  4. Final Answer:

    120 → Option B.
  5. Quick Check:

    Fix one person and permute the other 5 → 5! = 120 ✅
Hint: If directions are distinct, do not divide by 2; use (n - 1)!.
Common Mistakes: Dividing by 2 when clockwise and anticlockwise are considered different.
4. Eight people are to be seated around a circular table. In how many distinct ways can they sit if clockwise and anticlockwise arrangements are considered the same?
medium
A. 5040
B. 2520
C. 1260
D. 720

Solution

  1. Step 1: Identify n and symmetry

    n = 8 people; reflections (clockwise/anticlockwise) are identical.
  2. Step 2: State the necklace-like formula

    When both rotations and reflections are identical, use (n - 1)! / 2.
  3. Step 3: Compute and simplify

    (8 - 1)! / 2 = 7! / 2 = 5040 / 2 = 2520.
  4. Final Answer:

    2520 → Option B.
  5. Quick Check:

    7! counts rotations; dividing by 2 removes mirror duplicates → 2520 ✅
Hint: Use (n - 1)! / 2 when mirror images are considered identical (necklace-like).
Common Mistakes: Forgetting to divide by 2 when reflections are identical.
5. How many distinct necklaces can be made using 7 different beads if rotations and reflections are considered identical?
medium
A. 720
B. 360
C. 2520
D. 3240

Solution

  1. Step 1: Recognise necklace symmetry

    For a necklace both rotations and reflections are identical (for n > 2).
  2. Step 2: State the formula for necklaces

    Use formula (n - 1)! / 2.
  3. Step 3: Compute the value

    (7 - 1)! / 2 = 6! / 2 = 720 / 2 = 360.
  4. Final Answer:

    360 → Option B.
  5. Quick Check:

    Count linear circular arrangements 6! then divide by 2 for reflections → 360 ✅
Hint: Necklace problems usually require (n - 1)! / 2 when flips are identical.
Common Mistakes: Using (n - 1)! without dividing by 2 for reflections.

Mock Test

Ready for a challenge?

Take a 10-minute AI-powered test with 10 questions (Easy-Medium-Hard mix) and get instant SWOT analysis of your performance!

10 Questions
5 Minutes