浅淡正方形最优分割问题张延卫（江苏沭阳县教委２２３６００平面上正方形最优分割是指：将边长为１的正方形划分成ｎ个部分，求最大的实数δｎ，使得无论怎样分割，都存在属于同一部分的两个点，保证它们之间的距离不小于δｎ，称δｎ为划分最优值．余熙国先生在文［１］... Shallow light square optimal segmentation problem Zhang Yanwei (Jiangsu County Committee of Education, Jiangsu 223600 square optimal segmentation on the plane is: the side length of 1 square is divided into n parts, seeking the maximum real number δn, so no matter how segmentation, there are The two points of the same part, to ensure that the distance between them is not less than δn, said δn is divided into the optimal value. Mr. Yu Xiguo in the text [1]...