An aperiodic pseudorandom number generator (Q920537)

Examined are additive congruential generators with modulus 1 and constant irrational summand (which can be viewed as equivalent to Weyl sequences). How such generators can be implemented on computers (with integer arithmetic e.g.). is shown in an earlier paper of the author. The numerically analysed example (by some statistical tests) shows ``good'' behaviour with respect to discrepancy and somewhat lesser quality in another area. Modifications are proposed to enhance the quality.