USAMO 2002 Problem 6
- Day 2
I have an sheet of stamps, from which I've been asked to tear out blocks of three adjacent stamps in a single row or column. (I can only tear along the perforations separating adjacent stamps, and each block must come out of the sheet in one piece.) Let be the smallest number of blocks I can tear out and make it impossible to tear out any more blocks. Prove that there are real constants and such that for all .
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.