(Combination and Group Problems)
Seat the same n persons at a round table on
(n - 1)(n - 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.