CGMO 2015 Problem 3
In a grid, colour each unit square with either black or white, such that there is at least one black unit square in any and rectangle bounded by the grid lines. Determine, with proof, the minimum number of black unit squares.
Dataset text AI-MO AoPS. 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.
Similar problems
These problems have the most words in common with this statement.