MathDB
squares S_i of side 1/i can be put into a square side k without overlapping.

Source: 1974 Hungary - Kürschák Competition p2

October 15, 2022
combinatoricscombinatorial geometry

Problem Statement

SnS_n is a square side 1n\frac{1}{n}. Find the smallest kk such that the squares S1,S2,S3,...S_1, S_2,S_3, ... can be put into a square side kk without overlapping.
Back to ProblemsView on AoPS