Sign up ×
Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

Here is the question, from Bogart's :

A group of n married couples comes to a group discussion session where they all sit around a round table. In how many ways can they sit so that no person is next to his or her spouse? (Note that two people of the same sex can sit next to each other.

I appreciate any tips or advice.

share|cite|improve this question

2 Answers 2

up vote 4 down vote accepted

This is a variant of the Menage Problem and a solution of that can be found in one of Bogart's articles(no surprise there) itself:

(See the solution to the Relaxed Menage Problem).

share|cite|improve this answer
Thank You So Much - this clears it up a lot! – Adel Mar 6 '12 at 22:54
@Adel: You are welcome :-) – Aryabhata Mar 6 '12 at 23:03

I don't understand why " we begin with the set S of all (2n)! ways of seating the 2n individuals around the table" (from the article)...isn't it (2n-1)! options?

thank you.

share|cite|improve this answer
I think in that part of the solution, you don't consider circular rotations as equivalent: label the seats $1$, $2$, $\dots$, $2n$, then you're looking at $(2n)!$ ways of assigning the $2n$ individuals to the $2n$ seats. – ShreevatsaR Mar 27 '14 at 15:37
Actually you don't consider rotations as equivalent even in the final problem considered there. – ShreevatsaR Mar 27 '14 at 15:43

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.