Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

I am going through a solution of the following problem. "How many ways there are there to seat $n$ couples around a circular table with $2n$ chairs such that no couple sits next to each other, i.e., no husband and wife sit adjacent to each other."

  • The solution starts with the following : The number of possible arrangements where the men and women alternate is $2(n!)^2$, because, we can seat the women in $2n!$ ways, and for each such choice there are $n!$ ways to seat the men.

According to me this is true for linear permutation, not in case of circular permutation. in case of circular permutation the answer should be $n[(n-1)!]^2 $. Am I correct ?

share|cite|improve this question

You're regarding arrangements as equivalent if they differ by a cyclic permutation; the author of the solution isn't.

share|cite|improve this answer

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.