Mixed Congruential Random Number Generators for Binary Machines
- 1 January 1964
- journal article
- Published by Association for Computing Machinery (ACM) in Journal of the ACM
- Vol. 11 (1) , 31-40
- https://doi.org/10.1145/321203.321208
Abstract
Random number generators of the mixed congruential type have recently been proposed. They appear to have some advantages over those of the multiplicative type, except that their statistical behavior is unsatisfactory in some cases. It is shown theoretically that a certain class of these mixed generators should be expected to fail statistical tests for randomness. Extensive testing confirms this hypothesis and makes possible a more precise definition of the unsatisfactory class. It is concluded that the advantages of mixed generators can be realized only in special circumstances. On machines with relatively short multiplication times the multiplicative generators are to be preferred.Keywords
This publication has 11 references indexed in Scilit:
- Mixed Congruential Random Number Generators for Decimal MachinesJournal of the ACM, 1963
- Random Number GeneratorsSIAM Review, 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
- An a priori determination of serial correlation in computer generated random numbersMathematics of Computation, 1961
- A New Pseudo-Random Number GeneratorJournal of the ACM, 1960
- Serial Correlation in the Generation of Pseudo-Random NumbersJournal of the ACM, 1960
- On the Serial Test for Random SequencesThe Annals of Mathematical Statistics, 1957
- The serial test for sampling numbers and other tests for randomnessMathematical Proceedings of the Cambridge Philosophical Society, 1953