Some good multipliers for random number generator for 16-bit microcomputers

Chang Pao-long, Hwang Shiuh-nan, Kao Chiang

Research output: Contribution to journalArticlepeer-review

3 Citations (Scopus)


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 215 - 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.

Original languageEnglish
Pages (from-to)199-204
Number of pages6
JournalComputers and Operations Research
Issue number2
Publication statusPublished - 1994 Feb

All Science Journal Classification (ASJC) codes

  • Computer Science(all)
  • Modelling and Simulation
  • Management Science and Operations Research


Dive into the research topics of 'Some good multipliers for random number generator for 16-bit microcomputers'. Together they form a unique fingerprint.

Cite this