Implementing a multiple recursive generator with mersenne prime modulus

Abstract

This paper considers the problem of efficiently and correctly generating random numbers for the multiple recursive generators with Mersenne prime modulus. For the appropriate Mersenne prime modulus, simulated division is an efficient way to generate random numbers. The general algorithm for any Mersenne prime modulus is also presented.

Keywords:

• Random number generator
• Simulated division
• Mersenne multiplication

C.R. Categories:

• G.3
• I.6