Problem

Source: Dutch BxMO TST 2018 p1

Tags: combinatorics, circle, Coloring



We have $1000$ balls in $40$ different colours, $25$ balls of each colour. Determine the smallest $n$ for which the following holds: if you place the $1000$ balls in a circle, in any arbitrary way, then there are always $n$ adjacent balls which have at least $20$ different colours.