ON PACKINGS OF SQUARES AND RECTANGLES

被引:9
作者
JENNINGS, D [1 ]
机构
[1] UNIV SOUTHAMPTON,DEPT MATH,SOUTHAMPTON SO9 5NH,HANTS,ENGLAND
关键词
D O I
10.1016/0012-365X(94)00211-Z
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
This paper improves the previous bound (Jennings, in press), from 133/132 to 204/203, concerning the smallest square into which all of the rectangles of size 1/n x 1/(n + 1), n = 1,2,3,..., can be packed. It also investigates the problem of determining the rectangle of smallest area into which the squares of side 1/n, n = 3,5,7,..., can be packed.
引用
收藏
页码:293 / 300
页数:8
相关论文
共 3 条
[1]  
CROFT HT, 1991, UNSOLVED PROBLEMS IN, V2, P112
[2]  
JENNINGS D, IN PRESS J COMBIN A
[3]  
Meir A., 1968, J COMB THEORY, V5, P126, DOI DOI 10.1016/S0021-9800(68)80047-X