Birthday Squad Circular Arrangement

Probability · Medium · Free problem

Six friends sit down at a round table, each taking one of the 6 seats uniformly at random. All six friends have distinct ages. What is the probability that, reading around the table in at least one direction (clockwise or counter-clockwise), the friends are seated in strictly increasing order of age?

Generalize your answer to $n$ friends at an $n$-seat circular table.

Hints

  1. For circular arrangements, rotations of the same seating are considered identical -- how does this change the size of your sample space compared to a linear table?
  2. Fix one person's seat to eliminate rotational equivalence. The total number of distinct circular arrangements of $n$ people is $(n-1)!$.
  3. In how many of the $(n-1)!$ circular arrangements are the ages monotone around the table? Remember both directions count.

Worked Solution

How to Think About It: The first instinct is to write $6!/6! = 1$ for the probability, which is wrong because it ignores the circular symmetry. The real question is: out of all the distinct ways to seat 6 people around a circle, how many give a monotone age order? The key move is to nail down what "distinct" means for circular arrangements -- rotations of the same ordering should not be double-counted. Once you fix that, the numerator is almost obvious: there are exactly 2 valid orderings (clockwise-increasing and counter-clockwise-increasing), which are mirror images of each other.

Quick Estimate: With $n = 6$, the denominator is $(6-1)! = 120$ distinct circular seatings. The numerator is 2. So the probability is

/120 = 1/60 \approx 0.017$. That is about a 1-in-60 shot -- feels right. It is much smaller than
/6! \approx 0.0014$ (what you would get if you forgot circular symmetry), and much larger than
/(6! / 6) \cdot$ something absurd. The factor of 2 in the numerator comes from the two directions, which is a small but important detail -- without it you would get
/120$.

Approach: Count distinct circular arrangements using the fix-one-seat trick, then count how many satisfy the age-order condition.

Formal Solution:

*Counting the sample space.* For a linear arrangement of $n$ people there are $n!$ orderings. But in a circular table, rotating everyone one seat clockwise gives a physically identical arrangement -- all relative neighbor relationships are preserved. There are exactly $n$ such rotations (by $0, 1, 2, \ldots, n-1$ seats), so the number of truly distinct circular arrangements is

$\frac{n!}{n} = (n-1)!$

Alternatively: fix one person's seat (say, the oldest) and count the $(n-1)!$ ways to arrange the remaining friends. Same answer.

*Counting the favorable outcomes.* We need all ages to be in strictly increasing order going around the circle in at least one direction. Once we fix one person's seat (to remove rotational equivalence), there are exactly 2 arrangements that satisfy this:

  • Ages increase as you go clockwise.
  • Ages increase as you go counter-clockwise (equivalently, decreasing clockwise).

Note these two arrangements are distinct -- they are reflections, not rotations, of each other.

*Computing the probability.*

$P = \frac{2}{(n-1)!}$

For $n = 6$:

$P = \frac{2}{5!} = \frac{2}{120} = \frac{1}{60}$

Answer: $\displaystyle P = \frac{2}{(n-1)!}$, which equals $\dfrac{1}{60}$ for $n = 6$.

Intuition

The fix-one-seat trick is a fundamental move in circular combinatorics. Whenever you have a circular arrangement where rotations are equivalent, dividing by $n$ (or equivalently, anchoring one element) correctly collapses all redundant copies. This shows up constantly -- counting distinct necklaces, analyzing round-robin tournament draws, reasoning about cyclic queues in algorithms.

The factor of 2 in the numerator is the subtle part that trips people up. There are two distinct monotone orderings -- clockwise-increasing and counter-clockwise-increasing -- and they are not related by any rotation (only by a reflection). If the problem had asked for strictly one direction, the answer would be

/(n-1)!$, half as large. In combinatorics and probability, always ask yourself: does the problem have a symmetry (like direction) that doubles the count?

Open the full interactive solver →