-----BEGIN PGP SIGNED MESSAGE-----
Hash: SHA1

> Very simple, but it gives equidistribution to O(1/N) and has high
> apparent randomness (i.e., low autocorrelations).
>
> By the way, this sequence of numbers is superior for any purpose to
> any form of pseudorandom numbers. The equidistribution even on
> subsets is asymptotically guaranteed, it gives more accurate
> answers in estimation problems. It also has guaranteed low
> autocorrelations.

I see what you mean about high equidistribution.  I wrote a program
on my good ol TI-86 to run through this algorithm, and the seperation
between the number with the highest frequency and the number with the
lowest frequency is still only 5 at most with 700 iterations, as near
as I have seen.

I have only one concern.  1 and 3 seem to get the highest number of
selections on a base of 6.

I ran the sequence from 0 to 1023, and the results at the end were
encouraging.
1:171
2:171
3:170
4:171
5:171
6:169

The average was 3.492
the standard deviation was (I think) 0.837

(I'm still not too clear on standard deviation, but I think that's
accurate.)

All of that look about right?

- --Brendan

-----BEGIN PGP SIGNATURE-----
Version: PGPfreeware 6.5.8 for non-commercial use <http://www.pgp.com>

iQA/AwUBPVmDsgVk8xtQuK+BEQKjngCfcdRDJ1eWZe+P6bZMYyLKpDF79E0Ani4t
2KNFqUeKxWbSw1/Xrj0Xs3zA
=1Ags
-----END PGP SIGNATURE-----

--
http://www.piclist.com#nomail Going offline? Don't AutoReply us!
email listserv@mitvma.mit.edu with SET PICList DIGEST in the body