How Many Ways Can Men and Women Sit Around a Table with No Adjacent Men?

Assume the men and women are all distinct people, and that two seatings differing only by rotation count as the same. The standard method is to seat the women first: they create gaps around the table, and each gap can hold at most one man.

If there are $n$ men and $k$ women, where $k\ge 1$, the count is

$$\binom{k}{n}n!(k-1)!$$

provided $n\le k$. If $n>k$, no valid seating exists. The condition is necessary because each man needs a different gap between women.

Why the gap method works

First arrange the $k$ distinct women around the circular table. Since rotations are considered equivalent, fix one particular woman in a reference position; the other $k-1$ women can then be arranged in $(k-1)!$ ways.

The women form $k$ gaps around the circle, including the gap between the last and first women. To prevent two men from sitting next to each other, put no more than one man in each gap. Choose which $n$ gaps will be occupied, in $\binom{k}{n}$ ways, then arrange the $n$ distinct men in those gaps, in $n!$ ways. Multiplying the independent choices gives

$$(k-1)!\binom{k}{n}n!.$$

An equivalent form is

$$\frac{k!}{(k-n)!}(k-1)!.$$

Worked example: four men and six women

Suppose four distinct men and six distinct women are to sit around a table, with no two men adjacent.

1. Arrange the six women in a circle: $(6-1)!=120$ ways.
2. Choose four of the six gaps for the men: $\binom{6}{4}=15$ ways.
3. Arrange the four men in those chosen gaps: $4!=24$ ways.

Therefore,

$$5!\binom{6}{4}4!=120\cdot15\cdot24=43{,}200.$$

There are 43,200 circular seatings under the stated convention. Each seating is counted once: the circular order of the women, the selected gaps, and the identities of the men in those gaps uniquely specify the arrangement.

When is a seating possible?

With at least one woman, each woman-to-woman interval can accommodate at most one man. There are $k$ such intervals, so the condition is $n\le k$. For example, five men and four women cannot be seated without placing at least two men next to each other.

The formula also covers the case $n=0$: with $k\ge1$ distinct women, it gives $(k-1)!$ circular arrangements. If there are no women, the gap method does not apply. With no people there is one empty arrangement by some conventions; with only men, a valid seating is possible only for at most one man, depending on whether that degenerate case is included in the problem.

What if the seats are numbered?

The formula above identifies rotations. If the table has $n+k$ numbered seats and arrangements that differ by rotation count as different, multiply the circular count by $n+k$. With distinct people, each circular seating has exactly $n+k$ rotations because no nontrivial rotation leaves the entire seating unchanged.

Reflections are normally treated as different at a circular table: turning the order around produces a different clockwise seating. If a problem explicitly says mirror images are equivalent, this standard count needs a separate symmetry adjustment.

Common counting mistakes

• Forgetting the wraparound gap: The gap between the last and first women is also a place where a man could sit. There are $k$ gaps, not $k-1$.
• Allowing two men in one gap: That would put them next to each other, so each selected gap receives exactly one man.
• Dividing by rotations twice: The factor $(k-1)!$ already counts the women up to rotation. Do not divide the result by the total number of people again.
• Using the formula when $n>k$: The binomial coefficient is then zero under the usual convention, reflecting that no valid seating is possible.
• Ignoring whether people are distinct: The factor $n!$ counts assignments of individual men to gaps, and the women’s factorial counts their identities. If people of the same gender are indistinguishable, this is a different counting problem.