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

100 people are sitting at a round table, they are from 25 countries (4 per country). Pick one from each so that no two are adjacent. Any thoughts?

share|cite|improve this question
Yes. What is the question? – Emre Apr 30 '11 at 3:10
@Emre: Any thoughts on how to do this? – Prbmethod Apr 30 '11 at 3:18
I'd politely ask them to move as appropriate. – Emre Apr 30 '11 at 3:25
@Prbmethod: Please try to frame something that looks like an explicit mathematical question. Here is one, which may not be what you have in mind. There are $100$ people in a room, from $25$ countries, $4$ per country. How many ways are there to seat them at a (large) round table, so that no two people from the same country are next to each other? (And you might want to specify when we should consider two seating arrangements to be the same. If you shift all the people in a good arrangement to the right by $1$ chair, is this the same seating arrangement?) – André Nicolas Apr 30 '11 at 3:56
@Emre: What if they don't move? – AD. Apr 30 '11 at 3:59
up vote 2 down vote accepted

Use the Lovász local lemma. When I try to use it the parameters don't work, but I'm sure you can make it work...

share|cite|improve this answer
The example at the wikipedia page might be instructive. I haven't tried working out the details, but it is very similar. – Aaron Apr 30 '11 at 4:17

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.