AoPSWiki
Trying to get to the USAMO in 2010? Our AIME Problem Series can help you get there! Click here to enroll today!

2006 Romanian NMO Problems/Grade 7/Problem 2

From AoPSWiki

Revision as of 06:48, 18 March 2009 by Brut3Forc3 (Talk | contribs)
(diff) ← Older revision | Current revision (diff) | Newer revision → (diff)

Problem

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).

Solution

For n\leq6, consider this coloring for a 6x6 board:

\begin{tabular}{|c|c|c|c|c|c|}\hline R&Y&G&R&Y&G \\\hline G&R&Y&G&R&Y \\\hline Y&...

We can take the top n-by-n grid of this board as a coloring not satisfying the conditions. For n\geq7, we note that each row or column must have at least one color with 3 or more squares by the pigeonhole principle, so our answer is 7.

See also

Want to learn how to tackle those tough AMC/AIME/Olympiad algebra problems? Check out Art of Problem Solving's Intermediate Algebra by Richard Rusczyk and Mathew Crawford. Over 1600 problems!
© Copyright 2008 AoPS Incorporated. All Rights Reserved. • FoundationPrivacyContact Us