Linear congruential generator

The linear congruential generator is a common and simple kind of random number generator. All linear congruential generators use this formula:

• $s_{n}\equiv a\times s_{n-1}+c{\pmod {m}}$

Linear congruential generator is a draft programming task. It is not yet considered ready to be promoted as a complete task, for reasons that should be found in its talk page.

Where:

• $s_{0}$ is a seed.
• $s_{1}$, $s_{2}$, $s_{3}$, ..., are the random numbers.
• $a$, $c$, $m$ are constants.

If one selects the values of $a$, $c$ and $m$ with care, then the generator will yield uniform random numbers from $0$ to $m-1$.

BSD formula

• ${\begin{array}{lcl}seed&=&1103515245\times seed+12345{\pmod {2^{31}}}\\rand&=&seed\end{array}}$

Microsoft formula

• ${\begin{array}{lcl}seed&=&214013\times seed+2531011{\pmod {2^{31}}}\\rand&=&seed\div 2^{16}\end{array}}$

(Insert task here!)