On Tue, Feb 04, 2003 at 15:22:03 +0100, Dag-Erling Smorgrav wrote: > > Yes we do. We get a better sequence for any given seed, i.e. we get > less correlation between n and x(n) for any given x(0). I don't think > it changes much for long sequences, but we get a better distribution > for short sequences (including short subsequences of long sequences).
Maybe, I am not sure here, we need to ask expert. > As for patterns in the lower bits, we should try with a != 0 and see > how that affects the results. I believe the purpose of a in the LCG > algorithm is to scramble the lower bits. a != 0 eliminates 0 stuck problem, no additional visible effects. Even with a != 0 values are monotonically increased, I try with a == 123459876 0: 123459876 1: 185549787 2: 247639698 3: 309729609 4: 371819520 5: 433909431 6: 495999342 7: 558089253 8: 620179164 9: 682269075 -- Andrey A. Chernov http://ache.pp.ru/ To Unsubscribe: send mail to [EMAIL PROTECTED] with "unsubscribe freebsd-current" in the body of the message
