Generate sequences of pseudo-random numbers using one of two algorithms (see below)

Pseudo-random number sequences are generated using one of two algorithms:

- GJ Mitchell & DP Moore algorithm from The Art of Computer Programming vol 2 Seminumerical Algorithms 2nd edition by Donald E Knuth. This uses integer modulo arithmetic to seed the generator then subtractive combination to generate sequences in the range 0 <= x < 10e9. This implementation uses recommended number pair (24, 55). Other recommended pairs include (32, 65) but (27, 98) causes initialisation to fail.
- Mersenne Twister algorithm with coefficients for MT19937 © Makoto Matsumoto and Takuji Nishimura 1997-2002 in C implemented in JavaScript by Sean McCullough. Use and distribution is subject to conditions that the copyright, conditions and disclaimer must be propagated. The copyright holders and contributors do not endorse derivative products and disclaim express and implied warranties and liability of any nature from use even if notified. This uses a twisted generalised field register of rational normal form with state bit reflection and tempering to generate 32-bit values.