MathDB
Cutting square into squares of two sizes

Source: Kyiv City MO 2022 Round 1, Problem 11.5

January 23, 2022
combinatoricscutting the paper

Problem Statement

Find the smallest integer nn for which it's possible to cut a square into 2n2n squares of two sizes: nn squares of one size, and nn squares of another size.
(Proposed by Bogdan Rublov)
Back to ProblemsView on AoPS