Linear congruential generator: Difference between revisions

From SklogWiki
Jump to navigation Jump to search
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...)
 
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 18:28, 20 February 2007

The Lehmer algorithm can be written as

Failed to parse (SVG (MathML can be enabled via browser plugin): Invalid response ("Math extension cannot connect to Restbase.") from server "https://wikimedia.org/api/rest_v1/":): {\displaystyle y_{n+1}\equiv ay_n + b~~~(\mod ~m),}

where the user chooses Failed to parse (SVG (MathML can be enabled via browser plugin): Invalid response ("Math extension cannot connect to Restbase.") from server "https://wikimedia.org/api/rest_v1/":): {\displaystyle a} , Failed to parse (SVG (MathML can be enabled via browser plugin): Invalid response ("Math extension cannot connect to Restbase.") from server "https://wikimedia.org/api/rest_v1/":): {\displaystyle b} , Failed to parse (SVG (MathML can be enabled via browser plugin): Invalid response ("Math extension cannot connect to Restbase.") from server "https://wikimedia.org/api/rest_v1/":): {\displaystyle m} , and a seed value to initiate the algorithm, Failed to parse (SVG (MathML can be enabled via browser plugin): Invalid response ("Math extension cannot connect to Restbase.") from server "https://wikimedia.org/api/rest_v1/":): {\displaystyle y_0} .

See the prime modulus multiplicative linear congruential generator page.

References

  1. [ranLehmer51_photocopy]