Article ID: | iaor19941640 |
Country: | United Kingdom |
Volume: | 21 |
Issue: | 2 |
Start Page Number: | 199 |
End Page Number: | 204 |
Publication Date: | Feb 1994 |
Journal: | Computers and Operations Research |
Authors: | Chang Pao-Long, Kao Chiang, Hwang Shiuh-Nan |
Keywords: | simulation |
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 10912 primitive roots of the modulus 215-19=32749. The result shows that there are only 227 good multipliers among the 10912 candidate multipliers. Here a multiplier is said to be good if its corresponding generator has good statistical properties and computational efficiency.