IT-CESENATICO 1994 Problem 1
Show that there exists an integer such that for all a square can be partitioned into smaller 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.