Generate batches of pseudo-random numbers using GJ Mitchell & DP Moore algorithm from The Art of Computer Programming vol 2 Seminumerical Algoriths 2nd edition by Donald E Knuth. This uses modulo arithmetic to seed the generator then subtractive combination to generate a sequence. This implementation uses the number pair (24, 55). Other successful pairs include (32, 65) and (27, 98). It uses integer arithmetic in the range +-10e9 to generate random numbers in the range 0 <= x < 10e9 which are converted to other ranges required. Requested by Spencer Hamill |