Implementing a multiple recursive generator with Mersenne prime modulus

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