MathDB
Bulgarian National Mathematical Olympiad 2016, Problem 6

Source:

June 22, 2017
combinatorics

Problem Statement

Let nn be positive integer.A square AA of side length nn is divided by n2n^2 unit squares. All unit squares are painted in nn distinct colors such that each color appears exactly nn times. Prove that there exists a positive integer NN , such that for any n>Nn>N the following is true: There exists a square BB of side length n\sqrt{n} and side parallel to the sides of AA such that BB contains completely cells of 44 distinct colors.