The Round Table
Unreviewed import — a classic from the public domain; its solution has not been machine-checked yet.
math
Seat the same n persons at a round table on
(n - 1)(n - 2) -------------- 2
occasions so that no person shall ever have the same two neighbours twice. This is, of course, equivalent to saying that every person must sit once, and once only, between every possible pair.
Solution
Commit an attempt to unseal the proof. Write your answer — right or wrong, thinking it through is the point.
Rate this puzzle
Report a problem with this puzzle
Comments
No comments yet
Be the first to say something about this puzzle.