Editing Prime modulus multiplicative 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: | ||
:<math>y_{n+1}\equiv ay_n + b~~~(\mod ~m),</math> | |||
:<math>y_{n+1}\equiv ay_n + b | |||
The parameter <math>m</math> | The parameter <math>m</math> | ||
Line 22: | Line 20: | ||
==References== | ==References== | ||
#[http://dx.doi.org/10.1145/365696.365712 D. W. Hutchinson, "A New Uniform Pesudorandom Number Generator", Communications of the ACM, '''9''' pp. 432-433 (1966)] | #[http://dx.doi.org/10.1145/365696.365712 D. W. Hutchinson, "A New Uniform Pesudorandom Number Generator", Communications of the ACM, '''9''' pp. 432-433 (1966)] | ||
#[http:// | #[http://dx.doi.org/ | ||
#[http://dx.doi.org/10.1145/769800.769827 G. Marsaglia, "Seeds for Random Number Generators",Communications of the ACM, '''46''' pp. 90-93 (2003)] | #[http://dx.doi.org/10.1145/769800.769827 G. Marsaglia, "Seeds for Random Number Generators",Communications of the ACM, '''46''' pp. 90-93 (2003)] | ||
#[http://dx.doi.org/ | #[http://dx.doi.org/ | ||
#[http://dx.doi.org/ | |||
#[http://dx.doi.org/ | |||
#[CACM_1966_09_0432] | |||
#[IBM_1969_02_0136] | |||
#[CACM_2003_46_0090] | |||
#[MC_1999_68_249] | |||
#[CPC_1997_103_0103] | |||
[[Category: Random numbers]] | [[Category: Random numbers]] |