1933	 Coding the Lehmer Pseudo-random Number Generator	 An algorithm and coding technique is presented for quick evaluation of the Lehmer pseudo-random number generator modulo - a prime Mersenne number with produces - numbers on a p-bit greater than computer. The computation method is extendible to limited problems in modular arithmetic. Prime factorization for - and a primitive root for - the next largest prime Mersenne number are given for possible construction of a pseudo-random number generator of increased cycle length. pseudo-random number random number modular arithmetic uniform probability density uniform frequency function simulation prime factorization primitive roots
