Calculations with Pseudo-Random Numbers
- 1 January 1964
- journal article
- Published by Association for Computing Machinery (ACM) in Journal of the ACM
- Vol. 11 (1), 41-52
- https://doi.org/10.1145/321203.321209
Abstract
Two pseudo-random number generators are considered, the multiplicative congruential method and the mixed congruential method. Some properties of the generated sequences are derived, and several algorithms are developed for the evaluation of x i = @@@@( i ) and i = f -1 ( x i is the i th element of a pseudo-random number sequence.Keywords
This publication has 6 references indexed in Scilit:
- The behavior of pseudo-random sequences generated on computers by the multiplicative congruential methodMathematics of Computation, 1962
- Bias in Pseudo-Random NumbersJournal of the American Statistical Association, 1961
- A 48-bit pseudo-random generatorCommunications of the ACM, 1961
- Notes on a New Pseudo-Random Number GeneratorJournal of the ACM, 1961
- A New Pseudo-Random Number GeneratorJournal of the ACM, 1960
- On a Periodic Property of Pseudo-Random SequencesJournal of the ACM, 1958