Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Posting-Version: version B 2.10 5/3/83; site cmu-cs-g.ARPA
Path: utzoo!watmath!clyde!burl!ulysses!unc!mcnc!philabs!cmcl2!seismo!rochester!cmu-cs-pt!cmu-cs-g!monta
From: monta@cmu-cs-g.ARPA (Peter Monta)
Newsgroups: net.math,net.puzzle
Subject: Lists of points clarification
Message-ID: <206@cmu-cs-g.ARPA>
Date: Mon, 17-Dec-84 02:25:00 EST
Article-I.D.: cmu-cs-g.206
Posted: Mon Dec 17 02:25:00 1984
Date-Received: Thu, 20-Dec-84 01:49:53 EST
Organization: Carnegie-Mellon University, CS/RI
Lines: 29
Xref: watmath net.math:1661 net.puzzle:498

> Consider a (bounded) line-segment.  Choose point 1 anywhere on the segment.
> Then choose point 2 so that the first two points lie in different halves of
> the segment; choose point 3 so that the first three points all lie in
> different thirds of the segment; etc.  What is the maximum number of points
> you can choose (before further choice becomes impossible)?
>
> Peter Monta
>
>> 	It seems to me that I must be missing something because 
>> this looks easy. If I understand it correctly we are asked to
>>
>>		Greg Rawlins.

... solve a rather ill-stated problem.  Here is a more precise formulation:

Suppose we call a list of points ( p_1, p_2, ... , p_n ) in [0,1)
*evenly distributed* if each segment of the form [i/n,(i+1)/n) for 0<=i