Pick a prime p, and for a given seed, s, set x[s]=1/p and compute a[i], i>=s as follows:
The sequence <a[i]> is fairly wiggly and a[i] mod 256 doesn't FAIL (m)any of the DIEHARD tests.
To get the predictable part of the PRNG, note that for t>s and b[i], i>=t, where b[i] is computed as above with seed t, there is some i0 near t s.t. b[i]=a[i], all i>i0.
Rudolf Potucek wrote in message <firstname.lastname@example.org>... >Hi Everyone! > >I am looking for a way to generate a *reproducible* and *predictable* >pseudo random series (it should still be statistically distributed). >Ideally it would also be possible to generate the n-th element in the >series directly from the seed/first value instead of having to generate >all the intermediate series elements first. Can anyone give me a pointer >where to look? > >Thx, > > Rudolf >