Find, with proof, the maximum positive integer for which it is possible to color cells of a grid such that, for any choice of three distinct rows and three distinct columns , there exists an uncolored cell and integers so that lies in and .
Solution
The answer is . This can be obtained with the following construction: [grid image]. It now suffices to show that and are not attainable. The case is clear. Assume for sake of contradiction that the is attainable. Let be the rows of three distinct uncolored cells, and let be the columns of the other three uncolored cells. Then we can choose from and from 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.