MathDB
exists N, such for all n>=N a square can be partitioned into n smaller squares.

Source: 1994 ITAMO p1

January 30, 2020
partitionTilingcombinatoricscombinatorial geometrySquares

Problem Statement

Show that there exists an integer NN such that for all n≥Nn \ge N a square can be partitioned into nn smaller squares.
Back to ProblemsView on AoPS