MathDB
Dividing a square

Source: IMC 2000 Day 2 Problem 1

October 27, 2020

Problem Statement

Show that a square may be partitioned into nn smaller squares for sufficiently large nn. Show that for some constant N(d)N(d), a dd-dimensional cube can be partitioned into nn smaller cubes if n≥N(d)n \geq N(d) .
Back to ProblemsView on AoPS