Optimal multipliers for linear congruential pseudorandom number generators with prime moduli (Q1116259): Difference between revisions

The paper presents a new algorithm for the computation of multipliers for linear congruential pseudorandom number generator, which [according to \textit{I. Borosh} and \textit{H. Niederreiter}, ibid. 23, 65-74 (1983; Zbl 0505.65001)] are ``optimal'' (produce ``good'' pseudorandom numbers). The authors use so called Stern sequences [cf. \textit{M. A. Stern}, Über eine zahlentheoretische Funktion, Journal reine Angew. Math. 55, 193-220 (1858) and \textit{L. von Schrutka}, Neue Eigenschaften der Gaußischen Klammern und der Fareyschen Zahlenreihe, Math. Ann. 71, 565-583 (1912)] to compute optimal multipliers for seven moduli (e.g. 1048537, 8388617). No statistical tests of the proposed generators are presented.