Serial Correlation in the Generation of Pseudo-Random Numbers
- 1 January 1960
- journal article
- Published by Association for Computing Machinery (ACM) in Journal of the ACM
- Vol. 7 (1), 72-74
- https://doi.org/10.1145/321008.321018
Abstract
Many practiced and proposed methods for the generation of pseudo-random numbers for use in Monte Carlo calculation can be expressed in the following way: One chooses an integer P , the base; an integer λ, the multiplier, prime to P ; and an integer μ , the increment, less than P ( μ is frequently, but not always, zero).Keywords
This publication has 4 references indexed in Scilit:
- On Sequences of Pseudo-Random Numbers of Maximal LengthJournal of the ACM, 1958
- On a Periodic Property of Pseudo-Random SequencesJournal of the ACM, 1958
- Generating and Testing Pseudo Random Numbers on the IBM Type 701Mathematical Tables and Other Aids to Computation, 1956
- The Generation of Pseudo-Random Numbers on a Decimal CalculatorJournal of the ACM, 1954