The Central Idea
Suppose four people sit around a round table.
If their clockwise order is
\[ A,\ B,\ C,\ D, \]then rotating everyone one seat gives
\[ B,\ C,\ D,\ A. \]At an unlabeled round table, these two seatings have the same relative arrangement. Everyone has the same neighbors in the same clockwise order.
Ordinary linear permutation counting would count these rotations as different, so we must correct the overcounting.
Linear versus Circular Arrangements
For \(n\) distinct objects arranged in a row, there are
\[ n! \]possible arrangements.
Around an unlabeled circle, rotating all \(n\) objects together does not create a new relative arrangement.
Each circular arrangement is represented by \(n\) different linear rotations.
Therefore, the circular count is
\[ \frac{n!}{n}. \]The Circular Permutation Formula
For \(n\) distinct objects arranged around a circle, when rotations are considered equivalent but reflections are considered different, the number of circular permutations is
\[ \boxed{(n-1)!}. \]This follows from
\[ \frac{n!}{n}=(n-1)!. \]Why We Fix One Object
A practical way to remove rotational duplication is to fix one object in a reference position.
Suppose \(A\) is fixed.
The remaining \(n-1\) objects can then be arranged around \(A\) in
\[ (n-1)! \]ways.
Fixing one object does not remove any genuine relative arrangement. It only prevents us from recounting the same arrangement after rotation.
Example: Four People at a Round Table
Four distinct people sit around an unlabeled round table.
Fix one person as a reference.
The remaining three people can be arranged in
\[ 3! \]ways.
Therefore,
\[ \boxed{(4-1)!=3!=6}. \]Example: Seven People at a Round Table
Seven distinct people sit around an unlabeled circular table.
Fix one person and arrange the remaining six:
\[ \boxed{6!=720}. \]Rotations Are Equivalent
Consider the circular order
\[ ABCD. \]Rotating the same arrangement produces
\[ BCDA,\qquad CDAB,\qquad DABC. \]These are four different linear strings but only one circular arrangement.
This is why dividing \(4!\) by \(4\) gives
\[ \frac{24}{4}=6. \]Clockwise Order Matters
In ordinary circular permutations, reversing the order usually creates a different arrangement.
For example,
\[ A,B,C,D \]clockwise is generally different from
\[ A,D,C,B \]clockwise.
These are mirror images rather than rotations.
Rotations versus Reflections
The standard round-table formula
\[ (n-1)! \]identifies rotations but not reflections.
This distinction matters because some objects, such as bracelets or necklaces that can be flipped over, may also identify mirror-image arrangements.
Round Tables and Labeled Seats
The formula \((n-1)!\) assumes that only relative positions matter.
If the seats themselves are labeled, then rotations are no longer equivalent.
For \(n\) distinct people in \(n\) labeled seats, the count returns to
\[ \boxed{n!}. \]Example: Labeled Seats
Six people sit in six numbered seats arranged in a circle.
Because seat \(1\) is different from seat \(2\), a rotation changes which numbered seat each person occupies.
Therefore, the number of arrangements is
\[ \boxed{6!=720}, \]not \(5!\).
How to Decide Whether Rotation Counts
Ask whether rotating the entire arrangement changes anything that the problem considers meaningful.
If the circle has no distinguished starting point, rotations are usually equivalent.
If positions are labeled, numbered, fixed to compass directions, or otherwise distinguished, rotations usually count as different.
Example: People around a Campfire
Eight people sit evenly around a campfire with no labeled positions.
Only relative seating matters.
Therefore,
\[ \boxed{(8-1)!=7!=5040}. \]Example: Positions on a Clock Face
Suppose six distinct markers are assigned to six specified positions on a circular dial.
Because the positions are physically distinguished, rotations are not equivalent.
The number of assignments is
\[ \boxed{6!=720}. \]A Fixed Reference Person
Sometimes a problem already fixes one person in a specific place.
If \(n\) people sit around a round table and one particular person must occupy a designated reference seat, then the remaining \(n-1\) people can be arranged in
\[ \boxed{(n-1)!} \]ways.
This matches the ordinary circular-permutation count because fixing one person is exactly how rotational duplication is removed.
Two Particular People Must Sit Together
Suppose \(n\) distinct people sit around a round table and two particular people must sit next to each other.
Treat the two people as one block.
There are then
\[ n-1 \]circular units.
The number of circular arrangements of those units is
\[ (n-2)!. \]The two people inside the block can switch places in \(2!\) ways.
Therefore,
\[ \boxed{2(n-2)!}. \]Example: Two People Together
Six people sit around a round table. Alex and Blair must sit together.
Treat Alex and Blair as one block.
That gives \(5\) circular units:
\[ (5-1)!=4!. \]Alex and Blair can switch positions within the block:
\[ 2!. \]Therefore,
\[ 4!\cdot2 = 24\cdot2 = \boxed{48}. \]Why the Block Count Changes in a Circle
In a line, treating two people as one block among \(n\) people creates \(n-1\) units that can be arranged in
\[ (n-1)! \]ways.
Around a circle, those same \(n-1\) units have only
\[ (n-2)! \]distinct circular arrangements because rotations remain equivalent.
Two Particular People Must Not Sit Together
Complementary counting is often efficient.
Count all circular arrangements:
\[ (n-1)!. \]Count arrangements in which the two people are together:
\[ 2(n-2)!. \]Therefore, the number in which they are not adjacent is
\[ \boxed{(n-1)!-2(n-2)!}. \]Example: Two People Not Together
Six people sit around a round table. Alex and Blair must not sit together.
All circular arrangements:
\[ 5!=120. \]Arrangements with Alex and Blair together:
\[ 2(4!)=48. \]Therefore,
\[ 120-48=\boxed{72}. \]Three Particular People Must Sit Together
Suppose three specified people among \(n\) people must form one consecutive block around a table.
Treat the three people as one unit.
The total number of circular units becomes
\[ n-2. \]Their circular arrangements total
\[ (n-3)!. \]The three people inside the block can be ordered in
\[ 3! \]ways.
Therefore,
\[ \boxed{3!(n-3)!}. \]Example: Three People Together
Seven people sit around a round table. Three particular people must occupy consecutive seats.
Treat the three as one block. Then there are five circular units.
Their circular arrangements are
\[ 4!. \]The three people inside the block can be arranged in
\[ 3!. \]Therefore,
\[ 4!\cdot3! = 24\cdot6 = \boxed{144}. \]Alternating Two Groups
Circular arrangements often include alternating restrictions.
Suppose \(n\) people from one group and \(n\) people from another group must alternate around a round table.
First arrange one group around the circle:
\[ (n-1)!. \]Their positions create exactly \(n\) gaps.
Arrange the second group in those gaps:
\[ n!. \]Therefore,
\[ \boxed{(n-1)!n!}. \]Example: Alternating Groups
Four students from group \(A\) and four students from group \(B\) sit around a round table so that the groups alternate.
Arrange the four members of group \(A\):
\[ 3!. \]Then arrange the four members of group \(B\) in the four gaps:
\[ 4!. \]Therefore,
\[ 3!\cdot4! = 6\cdot24 = \boxed{144}. \]Why the Gap Method Works
Once the first group is arranged around the circle, there is exactly one gap between each adjacent pair.
Placing one member of the second group in every gap forces alternation.
This converts a positional restriction into an ordinary permutation of the available gaps.
One Person between Two Others
Circular restrictions can also be handled by fixing a reference person and analyzing neighboring positions.
Suppose \(A\) must sit between \(B\) and \(C\), meaning \(B\) and \(C\) must occupy the two seats adjacent to \(A\).
Fix \(A\).
Then \(B\) and \(C\) can occupy the two adjacent positions in
\[ 2! \]ways.
The remaining people can be arranged in the remaining positions.
Example: A Person between Two Others
Six people sit around a round table. Alex must sit between Blair and Casey.
Fix Alex.
Blair and Casey can occupy Alex's two neighboring seats in
\[ 2 \]ways.
The remaining three people can fill the remaining three seats in
\[ 3! \]ways.
Therefore,
\[ 2\cdot3! = \boxed{12}. \]Opposite Positions
If an even number of labeled seats are arranged around a circle, two seats may be designated as opposite.
Once a reference person is fixed, a particular second person may have only one opposite seat available.
The remaining people can then be arranged freely in the remaining positions.
Because opposite-position problems depend on the physical seat structure, always determine whether the seats are distinguishable before choosing a formula.
Example: Two People Opposite Each Other
Six people sit around a round table. Alex and Blair must sit opposite each other.
Fix Alex to remove rotational symmetry.
Blair then has exactly one opposite position.
The remaining four people can be arranged in
\[ 4! \]ways.
Therefore,
\[ \boxed{24} \]circular arrangements satisfy the condition.
Circular Arrangements of Objects Rather than People
Circular permutation ideas apply to any distinct objects arranged around a circle.
Examples include:
- colored markers around a circular board;
- symbols placed around a ring;
- stations around a loop;
- decorations around a circular boundary;
- vertices assigned labels on an unlabeled polygon.
Example: Distinct Beads on a Fixed Ring
Six distinct beads are attached around a ring that cannot be flipped over.
Rotations are equivalent, but reflections are different.
Therefore,
\[ \boxed{(6-1)!=120}. \]Necklaces and Bracelets
A necklace or bracelet may introduce an additional symmetry.
If the object can be flipped over, a clockwise arrangement and its reflected counterclockwise arrangement may become physically identical.
For \(n\) distinct objects with no additional symmetry complications, this can reduce the ordinary circular count by another factor of \(2\):
\[ \boxed{\frac{(n-1)!}{2}}. \]This formula applies when rotations and reflections are both considered equivalent.
Example: Distinct Beads on a Flippable Necklace
Six distinct beads are arranged on a necklace that can be rotated and flipped.
Rotational equivalence gives
\[ 5!=120. \]Reflection identifies each arrangement with its mirror image.
Therefore,
\[ \boxed{\frac{5!}{2}=60}. \]Why Reflection Is a Separate Question
A round-table seating cannot usually be flipped physically through the table, so mirror-image seatings are counted separately.
A necklace can often be turned over, so mirror images may become the same physical arrangement.
The geometry of the object determines which symmetries count as equivalent.
Repeated Objects around a Circle
Circular arrangements become more subtle when some objects are identical.
The simple repeated-object linear formula
\[ \frac{n!}{n_1!n_2!\cdots n_k!} \]does not automatically solve every circular problem, because rotational symmetry and repeated-object symmetry can interact.
For elementary problems, repeated circular arrangements are often handled by fixing a distinguished object or by careful case analysis.
A Distinguished Object Can Break the Symmetry
Suppose one object is unique while the remaining objects may include repetitions.
Fix the unique object as a reference point.
The remaining positions become effectively linear around that fixed reference, after which repeated-object counting can often be applied.
Example: One Unique Object with Repetition
Arrange the objects
\[ A,B,B,C,C \]around a circle, where \(A\) is unique.
Fix \(A\).
The remaining positions contain
\[ B,B,C,C. \]Their distinguishable arrangements are
\[ \frac{4!}{2!\,2!} = \boxed{6}. \]Overcounting by Rotation
Circular permutation formulas are an example of correcting overcounting.
Starting with \(n!\) linear arrangements counts each circular arrangement once for every possible starting point.
There are \(n\) starting points.
Therefore,
\[ \frac{n!}{n}=(n-1)!. \]Symmetry as an Equivalence Relation
Circular arrangements naturally group linear orderings into equivalence classes.
Two linear arrangements belong to the same class when one can be obtained from the other by rotation.
In the ordinary distinct-object case, each class contains exactly \(n\) linear rotations.
Dividing by \(n\) counts the equivalence classes rather than the individual linear representations.
Example: Five Objects
Five distinct objects have
\[ 5!=120 \]linear arrangements.
Each circular arrangement has five rotational representations.
Therefore,
\[ \frac{120}{5} = \boxed{24} \]circular arrangements exist.
Counting from Gaps
Once some objects are fixed around a circle, the gaps between them can become useful counting positions.
If \(k\) distinct objects are placed around a circle, they create exactly \(k\) gaps.
Gap counting is especially useful for alternating groups and for restrictions requiring separation.
Example: No Two from One Group Adjacent
Suppose four distinct red objects and four distinct blue objects must alternate around a circle.
Arrange the red objects first:
\[ 3!. \]They create four gaps.
Arrange the four blue objects in those gaps:
\[ 4!. \]Therefore,
\[ \boxed{3!\cdot4!=144}. \]Common Error: Using \(n!\) for an Unlabeled Circle
If \(n\) distinct people sit around an unlabeled round table, the count is not \(n!\).
Rotations have been counted repeatedly.
The correct count is
\[ \boxed{(n-1)!}. \]Common Error: Dividing by \(2\) Automatically
Reflections are not always equivalent.
Around an ordinary round table, clockwise and counterclockwise mirror-image seatings are different.
Therefore, do not divide by \(2\) unless the physical problem explicitly makes reflections equivalent.
Common Error: Using \((n-1)!\) for Labeled Seats
If the seats are numbered or otherwise distinguished, rotating everyone changes the arrangement.
Then the count is
\[ \boxed{n!}. \]Common Error: Treating a Circular Block Like a Linear Block
If two people among \(n\) must sit together around a circle, treating them as one block creates \(n-1\) circular units.
Those units have
\[ (n-2)! \]circular arrangements, not \((n-1)!\).
Including the internal order of the pair gives
\[ \boxed{2(n-2)!}. \]Common Error: Forgetting Internal Block Order
If Alex and Blair must sit together, the block can appear as
\[ AB \]or
\[ BA. \]These are two different local orders.
Therefore, multiply the block count by
\[ 2!. \]Common Error: Fixing More Than Necessary
Fixing one object removes rotational symmetry.
Fixing additional unrestricted objects can accidentally remove legitimate arrangements.
Use one reference object unless the problem itself imposes further fixed positions.
A Reliable Procedure for Basic Circular Permutations
- Determine whether the arrangement is circular.
- Ask whether the positions are labeled or unlabeled.
- Determine whether rotations are considered equivalent.
- Determine whether reflections are considered equivalent.
- For distinct objects with rotational equivalence only, fix one object.
- Arrange the remaining \(n-1\) objects in \((n-1)!\) ways.
- Apply blocks, gaps, complements, or other restrictions as needed.
- Check carefully for additional symmetry before dividing further.
A Reliable Symmetry Checklist
- Does rotating the entire arrangement produce the same outcome?
- Does reflecting or flipping the arrangement produce the same outcome?
- Are any positions labeled?
- Are any objects identical?
- Is there a unique object that can serve as a reference?
- Do any objects have to remain together or apart?
The answer to these questions determines which apparent permutations are genuinely distinct.
Example: Full Workflow
Eight distinct people sit around an unlabeled round table. Two particular people must sit together.
Rotations are equivalent, so this is a circular permutation problem.
Treat the required pair as one block.
The block plus the other six people produces seven circular units.
Their circular arrangements total
\[ (7-1)!=6!. \]The two people inside the block can switch places in
\[ 2! \]ways.
Therefore,
\[ 6!\cdot2 = 720\cdot2 = \boxed{1440}. \]Practice 1: Basic Circular Arrangement
How many ways can \(5\) distinct people sit around an unlabeled round table?
Practice 2: Larger Circular Arrangement
How many ways can \(8\) distinct people sit around an unlabeled round table?
Practice 3: Labeled Circular Seats
Six distinct people sit in six numbered seats arranged in a circle. How many seating arrangements are possible?
Practice 4: Two People Together
Seven people sit around a round table. Two particular people must sit together. How many arrangements are possible?
Practice 5: Two People Not Together
Seven people sit around a round table. Two particular people must not sit together. How many arrangements are possible?
Practice 6: Three People Together
Eight people sit around a round table. Three particular people must occupy consecutive seats. How many arrangements are possible?
Practice 7: Alternating Groups
Three people from group \(A\) and three people from group \(B\) sit around a round table so that the groups alternate. How many arrangements are possible?
Practice 8: Necklace
Five distinct beads are placed on a necklace that may be rotated and flipped. How many arrangements are possible?
Practice 9: Repeated Objects with a Unique Reference
Arrange
\[ A,B,B,C,C,C \]around a circle, where \(A\) is unique. How many distinguishable circular arrangements are possible?
Practice 10: Identify the Error
A student says that six people can sit around a round table in
\[ 6!=720 \]ways.
Explain the overcounting and give the correct count.
Practice Answers
Practice 1
\[ (5-1)! = 4! = \boxed{24}. \]Practice 2
\[ (8-1)! = 7! = \boxed{5040}. \]Practice 3
Because the seats are numbered, rotations count as different:
\[ \boxed{6!=720}. \]Practice 4
Treat the pair as one block. There are six circular units:
\[ 5!. \]Multiply by \(2!\) for the internal order of the pair:
\[ 5!\cdot2 = 120\cdot2 = \boxed{240}. \]Practice 5
All circular arrangements:
\[ 6!=720. \]Arrangements with the pair together:
\[ 5!\cdot2=240. \]Therefore,
\[ 720-240=\boxed{480}. \]Practice 6
Treat the three people as one block. There are six circular units:
\[ 5!. \]Arrange the three people inside the block in
\[ 3! \]ways.
Therefore,
\[ 5!\cdot3! = 120\cdot6 = \boxed{720}. \]Practice 7
Arrange the three members of group \(A\) around the circle:
\[ 2!. \]Arrange the three members of group \(B\) in the three gaps:
\[ 3!. \]Therefore,
\[ 2!\cdot3! = 2\cdot6 = \boxed{12}. \]Practice 8
Rotations and reflections are both equivalent:
\[ \frac{(5-1)!}{2} = \frac{24}{2} = \boxed{12}. \]Practice 9
Fix the unique \(A\). Arrange the remaining
\[ B,B,C,C,C \]around it:
\[ \frac{5!}{2!\,3!} = \frac{120}{12} = \boxed{10}. \]Practice 10
Each circular seating is counted once for each of the six possible choices of starting position.
Therefore,
\[ \frac{6!}{6} = 5! = \boxed{120}. \]What to Remember
For \(n\) distinct objects arranged around an unlabeled circle, with rotations considered equivalent and reflections considered different,
\[ \boxed{(n-1)!}. \]The easiest interpretation is to fix one object as a reference and arrange the remaining \(n-1\).
If the positions are labeled, use
\[ \boxed{n!}. \]If reflections are also equivalent, as with a freely flippable necklace of distinct objects,
\[ \boxed{\frac{(n-1)!}{2}}. \]Circular counting is fundamentally about symmetry. Before choosing a formula, determine which rotations, reflections, labels, and repeated objects produce genuinely new arrangements.
Where We Go Next
Permutations count outcomes in which order matters. Many important counting problems ask only which objects are selected, not the order in which they are listed.
The next lesson, Combinations, develops methods for unordered selections and explains why dividing permutation counts by internal reorderings leads to binomial coefficients.