Question 74
Determine the smallest integer $k$ for which the following story could hold true: In a chess tournament with 24 players, every pair of players plays at least two and at most $k$ games against each other. In the end of the tournament, it turns out that every player has played a different number of games.