Optimal packings of 13 and 46 unit squares in a square (Q1960280)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5799454
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Optimal packings of 13 and 46 unit squares in a square |
scientific article; zbMATH DE number 5799454 |
Statements
Optimal packings of 13 and 46 unit squares in a square (English)
0 references
13 October 2010
0 references
Summary: Let \(s(n)\) be the side length of the smallest square into which \(n\) non-overlapping unit squares can be packed. We show that \(s(m^2 - 3) = m\) for \(m = 4, 7\), implying that the most efficient packings of 13 and 46 squares are the trivial ones.
0 references
0.9434575
0 references
0.9062113
0 references
0.90309584
0 references
0.8951989
0 references
0.8923395
0 references
0.88742423
0 references
0 references
0.8821126
0 references
