For which $n \in N$ is it possible to arrange a tennis tournament for doubles with $n$ players such that each player has every other player as an opponent exactly once?
Source: Croatia TST 2003 p3
Tags: combinatorics
For which $n \in N$ is it possible to arrange a tennis tournament for doubles with $n$ players such that each player has every other player as an opponent exactly once?