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 a{y}_n+b(\mathrm{m}\mathrm{o}\mathrm{d}m),$

where the user chooses $a$, $b$, $m$, and a seed value to initiate the algorithm, $y_0$.

See also

• Prime modulus multiplicative linear congruential generator

External links

• Linear congruential generator page, hosted by pLab.