Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP Posting-Version: version B 2.10 5/3/83; site hou4b.UUCP Path: utzoo!watmath!clyde!cbosgd!cbdkc1!desoto!packard!hoxna!houxm!vax135!ariel!hou4b!esg From: esg@hou4b.UUCP (E.S.Gokhman) Newsgroups: net.math Subject: Re: list of points clarification Message-ID: <1238@hou4b.UUCP> Date: Wed, 26-Dec-84 11:46:14 EST Article-I.D.: hou4b.1238 Posted: Wed Dec 26 11:46:14 1984 Date-Received: Thu, 27-Dec-84 03:42:41 EST Organization: AT&T Information Systems Laboratories, Holmdel, NJ Lines: 29 I understand the *list of points* problem as following: Is there an algorithm Xn = F(n), where n is any natural number and 0 <= Xn < 1, that {X1, ..., Xn} are *evenly distributed for any n ? I suspect that this algorithm can not exist in general and it could exist for any given n < N, where N is any natural number. Note the difference, please. Thanx, Ed Subject: Re: list of points clarification Newsgroups: net.math, net.puzzle I understand the *list of points* problem as following: Is there an algorithm Xn = F(n), where n is any natural number and 0 <= Xn < 1, that {X1, ..., Xn} are *evenly distributed for any n ? I suspect that this algorithm can not exist in general and it could exist for any given n < N, where N is any natural number. Note the difference, please. Thanx, Ed