Linear congruential generator

The linear congruential generator for producing random numbers was developed by D. H. Lehmer and is sometimes known as the Lehmer algorithm. It can be written as

$y_{n+1}\equiv ay_{n}+b\qquad ({\mathrm {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 also

• Prime modulus multiplicative linear congruential generator

External links

• Linear congruential generator page, hosted by pLab.