olymmath

SILK-ROAD 2017 Problem 1

    On an infinite white checkered sheet, a square QQ of size 1212 × 1212 is selected. Petya wants to paint some (not necessarily all!) cells of the square with seven colors of the rainbow (each cell is just one color) so that no two of the 288288 three-cell rectangles whose centers lie in QQ are the same color. Will he succeed in doing this? (Two three-celled rectangles are painted the same if one of them can be moved and possibly rotated so that each cell of it is overlaid on the cell of the second rectangle having the same color.)

    (Bogdanov. I)

    Dataset text AoPS wiki problems. Quoted with source.

    Solutions

    No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.

    Add a solution

    Similar problems

    These problems have the most words in common with this statement.

    Locator silk-road/2017/p1 · Tag SN5X5PT1D1 · Edit this page on GitHub · Keys: j next, k previous