Linear congruential generator: Difference between revisions

Revision as of 13:31, 27 February 2007

The Lehmer algorithm can be written as

y_{n+1}\equiv ay_{n}+b~~(\mod m),

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

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)

Revision as of 19:19, 26 February 2007 (edit) Nice and Tidy (talk \| contribs) mNo edit summary ← Older edit		Revision as of 13:31, 27 February 2007 (edit) (undo) Nice and Tidy (talk \| contribs) mNo edit summary Newer edit →
Line 11:		Line 11:

	#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)		#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]]