Please use this identifier to cite or link to this item:
- Tightly packed squares
- Pegg Jr, Ed
- What is the smallest rectangle that can hold squares of sizes 1 to n? This problem is unsolved for more than 27 squares. The excess area in these packings is 0,1,1,5,5, 8,14,6,15,20, 7,17,17,20,25, 16,9,30,21,20, 33,27,28,28,22, 29,26. How the excess is bounded for higher n is an unsolved problem, but the bounds seem to be n/2 and 2n
- Componente Curricular::Ensino Fundamental::Séries Finais::Matemática
- Discrete Mathematics
- Educação Básica::Ensino Fundamental Final::Matemática::Espaço e forma
- Show tightly packed squares
- This demonstration needs the "MathematicaPlayer.exe" to run. Found in http://objetoseducacionais2.mec.gov.br/handle/mec/4737
- Demonstration freeware using Mathematica Player
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.