Thumbnail
Access Restriction
Subscribed

Author Rabung, J. R. ♦ Payne, W. H. ♦ Bogyo, T. P.
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Language English
Subject Keyword Prime factorization ♦ Simulation ♦ Modular arithmetic ♦ Pseudo-random number ♦ Primitive roots ♦ Uniform frequency function ♦ Uniform probability density ♦ Random number
Abstract An algorithm and coding technique is presented for quick evaluation of the Lehmer pseudo-random number generator modulo 2 ** 31 - 1, a prime Mersenne number which produces 2 ** 31 - 2 numbers, on a p-bit (greater than 31) computer. The computation method is extendible to limited problems in modular arithmetic. Prime factorization for 2 ** 61 - 2 and a primitive root for 2 ** 61 - 1, the next largest prime Mersenne number, are given for possible construction of a pseudo-random number generator of increased cycle length.
Description Affiliation: Washington State Univ., Pullman (Payne, W. H.; Rabung, J. R.; Bogyo, T. P.)
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 2005-08-01
Publisher Place New York
Journal Communications of the ACM (CACM)
Volume Number 12
Issue Number 2
Page Count 2
Starting Page 85
Ending Page 86


Open content in new tab

   Open content in new tab
Source: ACM Digital Library