The multiple prime random number generator

ABSTRACT

A new pseudorandom number generator, the Multiple Prime Random Number Generator, has been developed; it is efficient, conceptually simple, flexible, and easy to program. The generator utilizes cycles around prime numbers to guarantee the length of the period, which can easily be programmed to surpass the maximum period of any other presently available random number generator. There are minimum limits placed on the seed values of the variables because the period of the generator is not a function of the initial values of the variables. The generator passes thirteen standard random number generator tests. It requires only about fifteen lines of FORTRAN code to program and utilizes programming language constructs found in most major languages. Finally, it compares very favorably to the fastest of the other available generators.

REFERENCES

• 1: BINDER, K. Introduction: Theory and technical aspects of Monte Carlo simulations. In Topics in Current Physics: Monte Carlo Methods in Statistical Physics, K. Binder, Ed. Springer-Verlag, New York, 1979, pp. 1-45.
• 2: BINDER, K. Topics in Current Physics: Applications of the Monte Carlo Method in Statistical Physics. Springer-Verlag, New York, 1984, pp. 2-4.
• 3: IBM. Random number generation and testing. IBM Manual GC20-8011-0, IBM, Mechanicsburg, Pa., copyright 1959, reprinted 1969.
• 4: Donald E. Knuth, The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms, Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 1997
• 5: LEHMER, D.H. Mathematical methods in large scale computing units. In Proceedings of the 2nd Symposium on Large Scale Digital Calculating Machinery. Ann. Comput. Lab., Harvard Univ. XXVI, Cambridge, Mass., 1951, pp. 141-146.
• 6: T. G. Lewis , W. H. Payne, Generalized Feedback Shift Register Pseudorandom Number Algorithm, Journal of the ACM (JACM), v.20 n.3, p.456-468, July 1973 [doi>10.1145/321765.321777]
• 7: SELBY, S. M., ED. CRC Standard Mathematical Tables. 23rd ed. CRC Press, Boca Raton, Fla., 1975.
• 8: TAUSWORTHE, R. C. Random numbers generated by linear recurrence modulo two. Math. Comput. 19 (1965), 201-209.
• 9: J. P. R. Tootill , W. D. Robinson , A. G. Adams, The Runs Up-and-Down Performance of Tausworthe Pseudo-Random Number Generators, Journal of the ACM (JACM), v.18 n.3, p.381-399, July 1971 [doi>10.1145/321650.321655]
• 10: J. P. R. Tootill , W. D. Robinson , D. J. Eagle, An Asymptotically Random Tausworthe Sequence, Journal of the ACM (JACM), v.20 n.3, p.469-481, July 1973 [doi>10.1145/321765.321778]
• 11: John RB Whittlesey, A comparison of the correlational behavior of random number generators for the IBM 360, Communications of the ACM, v.11 n.9, p.641-644, Sept. 1968 [doi>10.1145/364063.364095]

INDEX TERMS

Classification:
  G. Mathematics of Computing
  G.3 PROBABILITY AND STATISTICS
      Subjects: Random number generation; Probabilistic algorithms (including Monte Carlo)

  I. Computing Methodologies
  I.6 SIMULATION AND MODELING

  J. Computer Applications
  J.2 PHYSICAL SCIENCES AND ENGINEERING
      Subjects: Mathematics and statistics
  J.4 SOCIAL AND BEHAVIORAL SCIENCES
      Subjects: Economics; Sociology

General Terms:
Algorithms, Economics, Experimentation, Performance, Reliability