Difference between revisions of "2006 Romanian NMO Problems/Grade 7/Problem 2"
m (→Solution) |
|||
| Line 2: | Line 2: | ||
A square of side <math>n</math> is formed from <math>n^2</math> unit squares, each colored in red, yellow or green. Find minimal <math>n</math>, 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). | A square of side <math>n</math> is formed from <math>n^2</math> unit squares, each colored in red, yellow or green. Find minimal <math>n</math>, 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). | ||
==Solution== | ==Solution== | ||
| + | {{solution}} | ||
| + | |||
==See also== | ==See also== | ||
*[[2006 Romanian NMO Problems]] | *[[2006 Romanian NMO Problems]] | ||
[[Category:Olympiad Combinatorics Problems]] | [[Category:Olympiad Combinatorics Problems]] | ||
Revision as of 08:33, 27 August 2008
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).
Solution
This problem needs a solution. If you have a solution for it, please help us out by adding it.
