Maths Olympiad Prep

Library / /679 of 860

Combinatorics Difficulty 5.4 AIME, harder Find the answer

Find, with proof, the maximum positive integer kk for which it is possible to color 6k6k cells of a 6×66 \times 6 grid such that, for any choice of three distinct rows R1,R2,R3R_{1}, R_{2}, R_{3} and three distinct columns C1,C2,C3C_{1}, C_{2}, C_{3}, there exists an uncolored cell cc and integers 1i,j31 \leq i, j \leq 3 so that cc lies in RiR_{i} and CjC_{j}.

A number or a short expression. Spacing and $ signs are ignored.

Solution

The answer is k=4k=4. This can be obtained with the following construction: [grid image]. It now suffices to show that k=5k=5 and k=6k=6 are not attainable. The case k=6k=6 is clear. Assume for sake of contradiction that the k=5k=5 is attainable. Let r1,r2,r3r_{1}, r_{2}, r_{3} be the rows of three distinct uncolored cells, and let c1,c2,c3c_{1}, c_{2}, c_{3} be the columns of the other three uncolored cells. Then we can choose R1,R2,R3R_{1}, R_{2}, R_{3} from {1,2,3,4,5,6}\{r1,r2,r3}\{1,2,3,4,5,6\} \backslash\left\{r_{1}, r_{2}, r_{3}\right\} and C1,C2,C3C_{1}, C_{2}, C_{3} from {1,2,3,4,5,6}\{c1,c2,c3}\{1,2,3,4,5,6\} \backslash\left\{c_{1}, c_{2}, c_{3}\right\} to obtain a contradiction.

Want a route through all this instead of an archive? The track puts 2,000 problems in a working order, from AMC 10 level to the IMO shortlist.

Source: Omni-MATH, licensed Apache-2.0. Statement and solution reproduced as published; topic and difficulty added by this site.