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$, Failed to parse (SVG (MathML can be enabled via browser plugin): Invalid response ("Math extension cannot connect to Restbase.") from server "https://wikimedia.org/api/rest_v1/":): {\displaystyle m} , and a seed value to initiate the algorithm, Failed to parse (SVG (MathML can be enabled via browser plugin): Invalid response ("Math extension cannot connect to Restbase.") from server "https://wikimedia.org/api/rest_v1/":): {\displaystyle y_0} .

See the prime modulus multiplicative linear congruential generator page.

References

1. [ranLehmer51_photocopy]