next up previous contents
Next: Provided an initial seed Up: Congruential Generators Previous: Congruential Generators   Contents

which defines \( \nu \protect \) as being congruent to n modulo m. It means that \( \nu \protect \) is the remainder

when n is divided by m, or \( \nu \protect \)= n-jm where j is the largest integer consistent with \( \nu \protect \) being non-negative. In particular we note that m = 2 gives the bits 0 and 1. The only possible value that \( \nu \protect \) can assume are the integers in the range 0 to m-1. A sequence of integers {\( \nu _{i} \)} can be generated from this relation by taking for n some function of the previous number \( \nu _{i-1} \), i.e.

\( \nu _{i} \)= f(\( \nu _{i-1} \)) mod m


Amaury LATAILLADE 2002-11-04