Problem

Source: Moldova TST 2020

Tags: combinatorics



In a chess tournament each player played one match with every other player. It is known that all players have different scores. The player who is on the last place got $k$ points. What is the smallest number of wins that the first placed player got? (For the win $1$ point is given, for loss $0$ and for a draw both players get $0,5$ points.)