Chess tournament
Source: MMC 2013
June 14, 2013
inductioncombinatorics proposedcombinatorics
Problem Statement
Determine the least integer for which the following story could hold true:
In a chess tournament with players, every pair of players plays at least and at most games against each other. At the end of the tournament, it turns out that every player has played a different number of games.