一个用正方形列填充正方形的问题  

A Problem on Packing a Square with Sequence of Squares

作　　者：张玉琴[1] 王贵双 张更生[3] 

机构地区：[1]天津大学理学院,天津300072 [2]河北职业通信技术学院基础部,河北石家庄050031 [3]河北师范大学数学与信息科学学院,河北石家庄050016

出　　处：《河北师范大学学报（自然科学版）》2008年第1期10-11,共2页Journal of Hebei Normal University：Natural Science

基　　金：国家自然科学基金(10571042);河北省自然科学基金(A2005000144);河北师范大学博士基金(L2004B04)

摘　　要：讨论了一个用正方形列填充正方形的问题.首先给出填充函数的定义:对于0<x<1,用Ps(x)表示能用正方形列{Qn}n∞=0所填充的最小正方形Q的边长,其中Qn的边长为xn且其边与Q的边平行放置.然后得出了Ps(x)的界及相关结果.A problem on packing squares with squares is discussed. Firstly the definition of the packing function is given： for 0 〈 x 〈 1 denote by Ps （x） the length of the side of the smallest square Q that can be packed by the sequence ｜ Qn｜n^∞= 1 of closed squares, where Qn has side of length x^n, and is placed so that their sides are parallel to those of Q. Finally the bounds of Ps （x） and the corresponding results are obtained.

关 键 词：填充 正方形列 填充函数 

分 类 号：O157.3[理学—数学]