Packing Unit Squares in a Rectangle

  title={Packing Unit Squares in a Rectangle},
  author={Hiroshi Nagamochi},
  journal={Electr. J. Comb.},
For a positive integer N , let s(N) be the side length of the minimum square into which N unit squares can be packed. This paper shows that, for given real numbers a, b ≥ 2, no more than ab− (a + 1− dae)− (b + 1− dbe) unit squares can be packed in any a′ × b′ rectangle R with a′ < a and b′ < b. From this, we can deduce that, for any integer N ≥ 4, s(N) ≥ min{d√Ne, √ N − 2b√Nc + 1 + 1}. In particular, for any integer n ≥ 2, s(n2) = s(n2 − 1) = s(n2 − 2) = n holds. 

From This Paper

Figures, tables, and topics from this paper.
3 Citations
6 References
Similar Papers


Publications citing this paper.


Publications referenced by this paper.
Showing 1-6 of 6 references

Geometrical packing and covering problems

  • F. Göbel
  • Packing and Covering in Combinatorics
  • 2000

Geometrical packing and covering problems, in Packing and Covering in Combinatorics, A

  • F. Göbel
  • Schrijver (ed.), Math Centrum Tracts,
  • 1979
2 Excerpts

Similar Papers

Loading similar papers…