Packing 10 or 11 unit squares in a square (Q1871371): Difference between revisions

Summary: Let \(s(n)\) be the side of the smallest square into which it is possible to pack \(n\) unit squares. We show that \(s(10)=3+\sqrt{1/2}\approx 3.707\) and that \(s(11)\geq 2+2\sqrt{4/5}\approx 3.789\). We also show that an optimal packing of 11 unit squares with orientations limited to \(0^\circ\) or \(45^\circ\) has side \(2+2\sqrt{8/9}\approx 3.886\). These results prove Martin Gardner's conjecture that \(n=11\) is the first case in which an optimal result requires a non-\(45^\circ\) packing.