How many ways are there to seat n couples around a circular table such that no couple sits next to each other?

I'm really not sure where to start with this one...I was able to find another question that is similar, but I'm not sure if the answer is the same since the question restricts the couples so they can't sit across from one another as opposed to next to each other like in my question. Here is the link to that question's page on stack exchange: https://math.stackexchange.com/questions/374367/problem-about-n-couples-sitting-at-a-round-table

  • 1
    $\begingroup$ Question seems to be quite popular today. See math.stackexchange.com/questions/2978566/… and the other questions linked there. $\endgroup$ – Gerry Myerson Oct 31 '18 at 2:50
  • 1
    $\begingroup$ Have you followed up on that link? $\endgroup$ – Gerry Myerson Nov 1 '18 at 10:09
  • $\begingroup$ I have thank you!! $\endgroup$ – Mathaholic24 Nov 1 '18 at 16:00
  • $\begingroup$ Good! Now, here's what you can do. If you now know how to solve the problem, you can write up and post an answer. Or, if you are convinced that your question is a duplicate of one that has been asked and answered before, you can vote to close your question as a duplicate. If you don't have the points needed to vote to close, you can just leave a comment indicating which question yours duplicates, and then someone else can come along and vote to close it. $\endgroup$ – Gerry Myerson Nov 1 '18 at 23:09

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Browse other questions tagged or ask your own question.