Linear congruential generator

From SklogWiki

Revision as of 17:26, 20 February 2007 by Carl McBride (talk | contribs) (New page: The Lehmer algorithm can be written as <math>y_{n+1}\equiv ay_n + b~~~(\mod ~m),</math> where the user chooses <math>a</math>, <math>b</math>, <math>m</math>, and a seed value to initiat...)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to navigation Jump to search

The Lehmer algorithm can be written as

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

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

References

[ranLehmer51_photocopy]

Retrieved from "http://www.sklogwiki.org/SklogWiki/index.php?title=Linear_congruential_generator&oldid=241"