 Linear congruential generator

Choose integers $M>1$, $a$, $c$ and a seed $S_0$. Iterate $S_{n+1}=(a{S}_n+c)\mathrm{mod}M$ and return $U_n=S_n/M$. This gives a deterministic finite-state pseudorandom number generator with output in $[0,1)$. A nonzero increment gives a mixed generator; $c=0$ gives a multiplicative generator. Its period is at most $M$, but even a full period does not guarantee good multidimensional uniformity or statistical independence.

A Linear Congruential Generator (LCG) is a type of pseudo-random number generator algorithm that utilizes a linear congruential formula to produce a sequence of pseudo-random numbers. It is one of the oldest and simplest methods for generating random numbers and is widely used in computer simulations, statistical sampling, and various other applications that require random number generation.