Editing Linear congruential generator
Jump to navigation
Jump to search
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 ''' | 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 | ||
:<math>y_{n+1}\equiv ay_n + b \qquad({\mathrm {mod}} ~m),</math> | :<math>y_{n+1}\equiv ay_n + b \qquad({\mathrm {mod}} ~m),</math> | ||
| Line 9: | Line 9: | ||
*[[Prime modulus multiplicative linear congruential generator]] | *[[Prime modulus multiplicative linear congruential generator]] | ||
==References== | ==References== | ||
#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) | |||
[[Category: Random numbers]] | [[Category: Random numbers]] | ||