A new uniform pseudorandom number generator
- 1 June 1966
- journal article
- Published by Association for Computing Machinery (ACM) in Communications of the ACM
- Vol. 9 (6) , 432-433
- https://doi.org/10.1145/365696.365712
Abstract
/) A new multiplicative congruential pseudorandom number generator is discussed, in which the modulus is the largest prime within accumulator capacity and the multiplier is a primitive root of that prime. This generator passes the usual statistical tests and in addition the least significant bits appear to be as random as the most significant bits--a property which generators having modulus 2 k do not possess.Keywords
This publication has 3 references indexed in Scilit:
- Mixed Congruential Random Number Generators for Binary MachinesJournal of the ACM, 1964
- Random Number GeneratorsSIAM Review, 1962
- Bias in Pseudo-Random NumbersJournal of the American Statistical Association, 1961