A method for generating random (pseudorandom) numbers using the linear recurrence relation
 |
where 
and 
must assume certain fixed values, 
is some chosen modulus, and 
is an initial number known as the seed.
Linear Congruence Method
See also
Pseudorandom Number, Random Number, SeedExplore with Wolfram|Alpha
References
Brunner, D. and Uhl, A. "Optimal Multipliers for Linear Congruential Pseudo Random Number Generators with Prime Moduli: Parallel Computation and Properties." BIT. Numer. Math. 39, 193-209, 1999.Pickover, C. A. "Computers, Randomness, Mind, and Infinity." Ch. 31 in Keys to Infinity. New York: W. H. Freeman, pp. 233-247, 1995.Referenced on Wolfram|Alpha
Linear Congruence MethodCite this as:
Weisstein, Eric W. "Linear Congruence Method." From MathWorld--A Wolfram Web Resource. https://mathworld.wolfram.com/LinearCongruenceMethod.html