MathDB
competition and two contestants

Source: Swiss IMO TST 2016. Problem 12

July 27, 2017
combinatorics

Problem Statement

In an EGMO exam, there are three exercises, each of which can yield a number of points between 00 and 77. Show that, among the 4949 participants, one can always find two such that the first in each of the three tasks was at least as good as the other.