Problem

Source: 2007 Cuba MO 1.3

Tags: combinatorics



A tennis competition takes place over four days, the number of participants is $2n$ with $n \ge 5$. Each participant plays exactly once a day (a couple of participants may be more times). Prove that such competition can end with exactly one winner and exactly three players in second place and such that there are no players with four lost games,