Large‐Order Multiple Recursive Generators with Modulus 231 − 1

The performance of a maximum‐period multiple recursive generator (MRG) depends on the choices of the recurrence order k, the prime modulus p, and the multipliers used. For a maximum‐period MRG, a large‐order k not only means a large period length (i.e., p^k − 1) but, more importantly, also guarantees the equidistribution property in high dimensions (i.e., up to k dimensions), a desirable feature for a good random‐number generator. As to generating efficiency, in addition to the multipliers, some special choices of the prime modulus p can significantly speed up the generation of pseudo‐random numbers by replacing the expensive modulo operation with efficient logical operations. To construct efficient maximum‐period MRGs of a large order, we consider the prime modulus p = 2³¹ − 1 and, via extensive computer search, find two large values of k, 7,499 and 20,897, for which p^k − 1 can be completely factorized. The successful search is achieved with the help of some results in number theory as well as some modern factorization methods. A general class of MRGs is introduced, which includes several existing classes of efficient generators. With the factorization results, we are able to identify via computer search within this class many portable and efficient maximum‐period MRGs of order 7,499 or 20,897 with prime modulus 2³¹ − 1 and multipliers of powers‐of‐two decomposition. These MRGs all pass the stringent TestU01 test suite empirically.