In 1957, Polish mathematician Hugo Steinhaus challenged his colleagues to find a curious set of numbers. [U]First, imagine a set of numbers arrayed in a regular grid, like intersections within an infinite piece of graph paper. Now imagine another set of numbers, dusted in an irregular pattern onto a plane. Steinhaus asked if it were possible to make a set such that no matter how you placed the grid on the plane, the grid and the irregular set always intersect at exactly one point. [/U]作者: uclb5550 时间: 2002-11-29 15:46
