Random Number Generators on Computers - Nakazawa, Naoya; Nakazawa, Hiroshi
106,99 €
inkl. MwSt.
Versandkostenfrei*
Versandfertig in 2-4 Wochen
payback
53 °P sammeln
  • Gebundenes Buch

This monograph proves that any finite random number sequence is represented by the multiplicative congruential (MC) way. It also shows that an MC random number generator (d, z) formed by the modulus d and the multiplier z should be selected by new regular simplex criteria to give random numbers an excellent disguise of independence.

Produktbeschreibung
This monograph proves that any finite random number sequence is represented by the multiplicative congruential (MC) way. It also shows that an MC random number generator (d, z) formed by the modulus d and the multiplier z should be selected by new regular simplex criteria to give random numbers an excellent disguise of independence.
Autorenporträt
Naoya Nakazawa obtained his DSci (applied number theory) at Osaka Prefectural University, Japan. He is now the representative (theory and computing) of Hirakata Ransu Factory (HRF). Hiroshi Nakazawa obtained his DSci (statistical physics) at Kyoto University, Japan. As a professor at Takuma National College of Technology, Japan, he enjoyed teaching students applied mathematics. He is now the representative (theory and general affairs) of HRF.