Problem #PRU-31361

Problems Discrete Mathematics Algorithm Theory Theory of algorithms (other)

Problem

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