Implementing a multiple recursive generator with mersenne prime modulus

DOI10.1080/00207160008805007zbMath0982.65004OpenAlexW1979673824MaRDI QIDQ4521207

Huey-Chin Tang

Publication date: 9 December 2001

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207160008805007

zbMATH Keywords

random number generationMersenne primes

Mathematics Subject Classification ID

Random number generation in numerical analysis (65C10)

Related Items (3)

Modified decomposition method for multiple recursive random number generator ⋮ Simulated division with approximate factoring for the multiple recursive generator with both unrestricted multiplier and non-Mersenne prime modulus ⋮ Symmetry properties of multiple recursive random number generators in full period and spectral test

Cites Work

• Some Experimental Observations on the Behavior of Composite Random Number Generators
• Implementing a random number package with splitting facilities
• Symmetry property of multiplicative congruential random number generator in chi-square test
• A search for good multiple recursive random number generators
• Coding the Lehmer pseudo-random number generator

This page was built for publication: Implementing a multiple recursive generator with mersenne prime modulus