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 24: | Line 22: | ||
#[http://www.research.ibm.com/journal/sj/082/ibmsj0802D.pdf P. A. W. Lewis and A. S. Goodman and J. M. Miller, "A pseudo-random number generator for the System/360", IBM Systems Journal '''2''' pp. 136 (1969)] | #[http://www.research.ibm.com/journal/sj/082/ibmsj0802D.pdf P. A. W. Lewis and A. S. Goodman and J. M. Miller, "A pseudo-random number generator for the System/360", IBM Systems Journal '''2''' pp. 136 (1969)] | ||
#[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/ | |||
#[MC_1999_68_249] | |||
#[CPC_1997_103_0103] | |||
[[Category: Random numbers]] | [[Category: Random numbers]] |