MathDB

1

Part of 1994 ITAMO

Problems(1)

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

Source: 1994 ITAMO p1

1/30/2020
Show that there exists an integer NN such that for all n≥Nn \ge N a square can be partitioned into nn smaller squares.
partitionTilingcombinatoricscombinatorial geometrySquares