Generalized inversive congruential pseudorandom numbers

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 m = p 1 , … p r {\displaystyle m=p_{1},\dots p_{r}} with arbitrary distinct primes p 1 , … , p r ≥ 5 {\displaystyle p_{1},\dots ,p_{r}\geq 5} will be present here.