Linear congruential generator

The Lehmer algorithm can be written as

$y_{n+1}\equiv ay_{n}+b~~~(\mod ~m),$

where the user chooses $a$, $b$, $m$, and a seed value to initiate the algorithm, $y_{0}$.

See the prime modulus multiplicative linear congruential generator page.

References

1. [ranLehmer51_photocopy]