Linear congruential generator: Difference between revisions
Jump to navigation
Jump to search
Carl McBride (talk | contribs) m (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...) |
Carl McBride (talk | contribs) mNo edit summary |
||
| Line 6: | Line 6: | ||
the algorithm, <math>y_0</math>. | the algorithm, <math>y_0</math>. | ||
See the [[Prime modulus multiplicative linear congruential generator| prime modulus multiplicative linear congruential generator]] page. | |||
==References== | ==References== | ||
#[ranLehmer51_photocopy] | #[ranLehmer51_photocopy] | ||
Revision as of 17:28, 20 February 2007
The Lehmer algorithm can be written as
where the user chooses , , , and a seed value to initiate the algorithm, .
See the prime modulus multiplicative linear congruential generator page.
References
- [ranLehmer51_photocopy]