2006 Romanian NMO Problems/Grade 7/Problem 2

Revision as of 08:33, 27 August 2008 by 1=2 (talk | contribs) (Solution)


A square of side $n$ is formed from $n^2$ unit squares, each colored in red, yellow or green. Find minimal $n$, such that for each coloring, there exists a line and a column with at least 3 unit squares of the same color (on the same line or column).


This problem needs a solution. If you have a solution for it, please help us out by adding it.

See also

Invalid username
Login to AoPS