A Square-Packing Problem of Erdoes

From MaRDI portal





Paul Erdős posed the following problem: inscribe \(n\) squares into a unit square, such that no two of them have a common interior point. Add up the \(n\) edge lengths, and let \(f(n)\) denote the largest possible sum. What is \(f(n)\)? For which \(n\) is \(f(n)=f(n+1)\)? The paper shows that if \(f(n)=f(n+1)\), then \(n\) is perfect square.











This page was built for publication: A Square-Packing Problem of Erdoes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5703695)