Seat the same $n$ persons at a round table on $$\frac{(n - 1)(n - 2)}2$$ occasions so that no person shall ever have the same two neighbors twice. This is, of course, equivalent to saying that every person must sit once, and once only, between every possible pair.
Solutions: 1
This eBook is for the use of anyone anywhere in the United States and most other parts of the world at no cost and with almost no restrictions whatsoever. You may copy it, give it away or re-use it under the terms of the Project Gutenberg License included with this edition or online at http://www.gutenberg.org. If you are not located in the United States, you'll have to check the laws of the country where you are located before using this ebook.
