Skip to Main Content

Mathematics of Computation

Published by the American Mathematical Society since 1960 (published as Mathematical Tables and other Aids to Computation 1943-1959), Mathematics of Computation is devoted to research articles of the highest quality in computational mathematics.

ISSN 1088-6842 (online) ISSN 0025-5718 (print)

The 2020 MCQ for Mathematics of Computation is 1.78.

What is MCQ? The Mathematical Citation Quotient (MCQ) measures journal impact by looking at citations over a five-year period. Subscribers to MathSciNet may click through for more detailed information.


Lower bounds for the discrepancy of inversive congruential pseudorandom numbers
HTML articles powered by AMS MathViewer

by Harald Niederreiter PDF
Math. Comp. 55 (1990), 277-287 Request permission


The inversive congruential method is a uniform pseudorandom number generator which was introduced recently. For a prime modulus p the discrepancy $D_p^{(k)}$ of k-tuples of successive pseudorandom numbers generated by this method determines the statistical independence properties of these pseudorandom numbers. It was shown earlier by the author that \[ D_p^{(k)} = O({p^{ - 1/2}}{(\log p)^k})\quad {\text {for}}\;2 \leq k < p.\] Here it is proved that this bound is essentially best possible. In fact, for a positive proportion of the admissible parameters in the inversive congruential method the discrepancy $D_p^{(k)}$ is at least of the order of magnitude ${p^{ - 1/2}}$ for all $k \geq 2$.
Similar Articles
  • Retrieve articles in Mathematics of Computation with MSC: 65C10, 11K45
  • Retrieve articles in all journals with MSC: 65C10, 11K45
Additional Information
  • © Copyright 1990 American Mathematical Society
  • Journal: Math. Comp. 55 (1990), 277-287
  • MSC: Primary 65C10; Secondary 11K45
  • DOI:
  • MathSciNet review: 1023766