A pseudo-random number generator for the System/360
Peter Lewis, A. S. Goodman, J. Michael Miller · IBM Systems Journal · 1969
The purpose of this paper is to describe a pseudo-random number generator that uses the full capacity of the 32-bit registers of IBM SYSTEM/360 computers, and to briefly report on and document the testing of and experience with the random number generator. The generator is a particular case of the sequence of numbers xigenerated by the equation xi+1= Axi(mod p) (1) where p is a prime and A is a positive primitive root of p.
Cited by 370 works. doi:10.1147/sj.82.0136
Authors
References
- An Algorithm for the Machine Calculation of Complex Fourier Series
- The Statistical Analysis of Series of Events.
- Uniform Random Number Generators
- RANDOM NUMBERS FALL MAINLY IN THE PLANES
- Fourier Analysis of Uniform Random Number Generators
- The serial test for sampling numbers and other tests for randomness
- Coding the Lehmer pseudo-random number generator
- A comparison of the correlational behavior of random number generators for the IBM 360
- A new uniform pseudorandom number generator
- Multiplicative congruential pseudo-random number generators