If you need an accessible version of this item please contact JSTOR User Support

On Generalized Inversive Congruential Pseudorandom Numbers

Jürgen Eichenauer-Herrmann
Mathematics of Computation
Vol. 63, No. 207 (Jul., 1994), pp. 293-299
DOI: 10.2307/2153575
Stable URL: http://www.jstor.org/stable/2153575
Page Count: 7
  • Download PDF
  • Cite this Item

You are not currently logged in.

Access your personal account or get JSTOR access through your library or other institution:

login

Log in to your personal account or through your institution.

If you need an accessible version of this item please contact JSTOR User Support
On Generalized Inversive Congruential Pseudorandom Numbers
Preview not available

Abstract

The inversive congruential method with prime modulus for generating uniform pseudorandom numbers has several very promising properties. Very recently, a generalization for composite moduli has been introduced. In the present paper it is shown that the generated sequences have very attractive statistical independence properties.

Page Thumbnails

  • Thumbnail: Page 
293
    293
  • Thumbnail: Page 
294
    294
  • Thumbnail: Page 
295
    295
  • Thumbnail: Page 
296
    296
  • Thumbnail: Page 
297
    297
  • Thumbnail: Page 
298
    298
  • Thumbnail: Page 
299
    299