SOME GOOD MULTIPLIERS FOR RANDOM NUMBER GENERATOR FOR 16-BIT MICROCOMPUTERS

Abstract

In searching for statistically sound multipliers for the prime modulus multiplicative congruential random number generator for 16-bit microcomputers, an exhaustive analysis is conducted over the 10,912 primitive roots of the modulus 2(15)-19=32,749. The result shows that there are only 227 good multipliers among the 10,912 candidate multipliers. Here a multiplier is said to be good if its corresponding generator has good statistical properties and computational efficiency.