Linear congruential generator - Revision history

Nice and Tidy: Slight tidy

2009-11-10T15:21:57Z

Slight tidy

← Older revision		Revision as of 17:21, 10 November 2009
Line 1:		Line 1:
	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		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

	:<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==
			<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)~~		==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]]		[[Category: Random numbers]]

Carl McBride at 13:15, 12 February 2008

2008-02-12T13:15:53Z

← Older revision		Revision as of 15:15, 12 February 2008
Line 1:		Line 1:
	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		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~~(\mod m),</math>		:<math>y_{n+1}\equiv ay_n + b \qquad({\mathrm {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

Carl McBride at 13:13, 12 February 2008

2008-02-12T13:13:43Z

← Older revision		Revision as of 15:13, 12 February 2008
Line 1:		Line 1:
	The Lehmer algorithm can be written as		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~~(\mod m),</math>		:<math>y_{n+1}\equiv ay_n + b~~(\mod m),</math>
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.~~		==See also==
			*[[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)		#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]]

Nice and Tidy at 11:31, 27 February 2007

2007-02-27T11:31:20Z

← Older revision		Revision as of 13:31, 27 February 2007
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]]

Nice and Tidy at 17:19, 26 February 2007

2007-02-26T17:19:28Z

← Older revision		Revision as of 19:19, 26 February 2007
Line 1:		Line 1:
	The Lehmer algorithm can be written as		The Lehmer algorithm can be written as

	<math>y_{n+1}\equiv ay_n + b~~(\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

Carl McBride at 10:40, 23 February 2007

2007-02-23T10:40:34Z

← Older revision		Revision as of 12:40, 23 February 2007
Line 1:		Line 1:
	The Lehmer algorithm can be written as		The Lehmer algorithm can be written as

	<math>y_{n+1}\equiv ay_n + b~~~(\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
Line 9:		Line 9:

	==References==		==References==
	#~~[ranLehmer51_photocopy]~~
			#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)

Carl McBride at 17:28, 20 February 2007

2007-02-20T17:28:04Z

← Older revision		Revision as of 19:28, 20 February 2007
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]

Carl McBride: New page: 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 initiat...

2007-02-20T17:26:43Z

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...

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 initiate
the algorithm, <math>y_0</math>.

==References==
#[ranLehmer51_photocopy]