MathDB
min n to paint 8x8 board such that each 3x1 tile has different colours

Source: 2011 Brazil IMO TST 4.1

July 24, 2021
combinatoricsTilingtiles

Problem Statement

Find the smallest positive integer nn such that it is possible to paint each of the 6464 squares of an 8×88 \times 8 board of one of nn colors so that any four squares that form an LL as in the following figure (or congruent figures obtained through rotations and/or reflections) have different colors. https://cdn.artofproblemsolving.com/attachments/a/2/c8049b1be8f37657c058949e11faf041856da4.png