Linear congruential generator

From SklogWiki

Jump to: navigation, search

The inear congruential generator was developed by D. H. Lehmer (Ref. 1) 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, m, and a seed value to initiate the algorithm, y0.

[edit] See also

[edit] References

  1. D. H. Lehmer, "Mathematical methods in large-scale computing units", Proceedings of the 2nd Symposium on Large-Scale Digital Calculating Machinery, vol XXVI pp. 141-146 The Annals of the Computational Laboratory of Harvard University, Harvard University Press (1951)
Retrieved from "http://www.sklogwiki.org/SklogWiki/index.php/Linear_congruential_generator"
Personal tools