Generalized inversive congruential pseudorandom numbers (original) (raw)

An approach to nonlinear congruential methods of generating uniform pseudorandom numbers in the interval [0,1) is the Inversive congruential generator with prime modulus. A generalization for arbitrary composite moduli with arbitrary distinct primes will be present here. Let . For integers with gcd (a,m) = 1 a generalized inversive congruential sequence of elements of is defined by where denotes the number of positive integers less than m which are relatively prime to m.