We begin by discussing the linear congruential generator - the one most commonly used for generating random integers.

Here, we generate the next random integer using the previous random
integer , the integer constants **a** and **c**, and the integer modulus
**m**.
After the integer is generated, modulo arithmetic using the modulus
m is performed, to yield the new "random" integer .

To get started, the algorithm requires an initial ``seed,'' , which must
be
provided by some means (we shall discuss this later). The entire sequence is
characterized by the multiplier, **a**; the additive constant, **c**; the modulus,
**m**; and the initial seed . Following Anderson [3],
we
therefore refer to the sequence generated as , which
completely determines the sequence. Here, LCG denotes a Linear, Congruential
Generator.