MathDB
10th EMC - Colouring the set 1, 2, ..., n

Source: 10th European Mathematical Cup - Problem J4

December 22, 2021
emcEuropean Mathematical CupcombinatoricspartitionsColoringRamsey Theory

Problem Statement

Let nn be a positive integer. Morgane has coloured the integers 1,2,,n1,2,\ldots,n. Each of them is coloured in exactly one colour. It turned out that for all positive integers aa and bb such that a<ba<b and a+bna+b \leqslant n, at least two of the integers among aa, bb and a+ba+b are of the same colour. Prove that there exists a colour that has been used for at least 2n/52n/5 integers. \\ \\ (Vincent Jugé)