Warning: You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in or
create an account, your edits will be attributed to your username, along with other benefits.
The edit can be undone.
Please check the comparison below to verify that this is what you want to do, and then publish the changes below to finish undoing the edit.
Latest revision |
Your text |
Line 1: |
Line 1: |
| The '''linear congruential generator''' for producing [[random numbers]] was developed by D. H. Lehmer <ref>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)</ref> and is sometimes known as the Lehmer algorithm. It can be written as | | The Lehmer algorithm can be written as |
|
| |
|
| :<math>y_{n+1}\equiv ay_n + b \qquad({\mathrm {mod}} ~m),</math>
| | <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 initiate | | where the user chooses <math>a</math>, <math>b</math>, <math>m</math>, and a seed value to initiate |
| the algorithm, <math>y_0</math>. | | the algorithm, <math>y_0</math>. |
|
| |
|
| ==See also==
| |
| *[[Prime modulus multiplicative linear congruential generator]]
| |
| ==References== | | ==References== |
| <references/>
| | #[ranLehmer51_photocopy] |
| ==External links==
| |
| *[http://random.mat.sbg.ac.at/~charly/server/node3.html Linear congruential generator] page, hosted by [http://random.mat.sbg.ac.at/ pLab].
| |
| [[Category: Random numbers]]
| |