DK-GEORGMOHR 2002 Problem 2
Prove that for any integer greater than , a square can be divided into squares.
Dataset text AI-MO AoPS. Quoted with source.
Official text: Georg Mohr Contest 2002 official paper, page 1.
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.