Multiplicative congruential generator

A Congruence Generator in the form $x_1=x_{0}a\mathrm{mod}(m)$.

---

Period

The period for this sequence is $m-1$, hence this sequence cannot take more than $m$ times before it repeats, hence you should choose a very large $m$.

Pattern goals

We do not want an obvious pattern between numbers or a zero as after 0 the sequence will continue to be 0.

A example of a combination of convenient $a$ and $m$ for calculation on a computer with a sufficiently large period are $m=2^{31}-1$ and $a=16807$.

---

Examples

$a=13$, $m=31$ $x_0=2$

$x_1=2\ast 13\mathrm{mod}(31)=26$ $x_2=26\ast 13\mathrm{mod}(31)=28$ …