Difference between revisions of "2006 Romanian NMO Problems/Grade 7/Problem 2"
| Line 4: | Line 4: | ||
==See also== | ==See also== | ||
*[[2006 Romanian NMO Problems]] | *[[2006 Romanian NMO Problems]] | ||
| + | [[Category:Olympiad Combinatorics Problems]] | ||
Revision as of 09:00, 28 July 2006
Problem
A square of side 
is formed from 
unit squares, each colored in red, yellow or green. Find minimal , 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).
