link lcseval
May 23, 1996; Ralph E. Griswold
Requires: large integers
This file is in the public domain.
rcseval(a, c, m) evaluates the constants used in a linear congruence recurrence for generating a sequence of pseudo-random numbers. a is the multiplicative constant, c is the additive constant, and m is the modulus. Any line of output starting with asterisks indicates a problem. See Donald E. Knuth, "Random Numbers" in The Art of Computer Programming, Vol. 2, Seminumerical Algorithms, Addison-Wesley, Reading, Massachusetts, 1969, pp. 1-160. ____________________________________________________________ Deficiency: The modulus test for a assumes m is a power of 2.