Problem #PRU-31361

Problems Set theory and logic Theory of algotithms Theory of algorithms (other)

Problem

An 8×8 square is painted in two colours. You can repaint any 1×3 rectangle in its predominant colour. Prove that such operations can make the whole square monochrome.