RANDU

RANDU^[1] is a linear congruential pseudorandom number generator (LCG) of the Park–Miller type, which was used primarily in the 1960s and 1970s.^[2] It is defined by the recurrence

${\displaystyle V_{j+1}=65539\cdot V_{j}{\bmod {2}}^{31}}$

Three-dimensional plot of 100,000 values generated with RANDU. Each point represents 3 consecutive pseudorandom values. It is clearly seen that the points fall in 15 two-dimensional planes.

with the initial seed number ${\displaystyle V_{0}}$ as an odd number. It generates pseudorandom integers ${\displaystyle V_{j}}$ which are uniformly distributed in the interval [1, 2³¹ − 1], but in practical applications are often mapped into pseudorandom rationals ${\displaystyle X_{j}}$ in the interval (0, 1), by the formula

${\displaystyle X_{j}={\frac {V_{j}}{2^{31}}}.}$

IBM's RANDU is widely considered to be one of the most ill-conceived random number generators ever designed,^[3] and was described as "truly horrible" by Donald Knuth.^[4] It fails the spectral test badly for dimensions greater than 2, as shown below.

The reason for choosing these particular values for the multiplier and modulus had been that with a 32-bit-integer word size, the arithmetic of mod 2³¹ and ${\displaystyle 65539=2^{16}+3}$ calculations could be done quickly, using bitwise operators in hardware, but the values were chosen for computational convenience, not statistical quality.

Problems with multiplier and modulus

For any linear congruential generator with modulus m used to generate points in n-dimensional space, the points fall in no more than ${\displaystyle (n!\times m)^{1/n}}$ parallel hyperplanes.^[5] This indicates that low-modulus LCGs are unsuited to high-dimensional Monte Carlo simulation. For m = 2³¹ and n = 3, an LCG could have up to 2344 planes, theoretical maximum. A much tighter upper bound is proved in the same Marsaglia paper to be the sum of the absolute values of all the coefficients of the hyperplanes in standard form. That is, if the hyperplanes are of the form Ax₁ + Bx₂ + Cx₃ = some integer such as 0, 1, 2 etc, then the maximum number of planes is |A| + |B| + |C|.^[5]

Now we examine the values of multiplier 65539 and modulus 2³¹ chosen for RANDU. Consider the following calculation where every term should be taken mod 2³¹. Start by writing the recursive relation as

${\displaystyle x_{k+2}=(2^{16}+3)x_{k+1}=(2^{16}+3)^{2}x_{k},}$

which after expanding the quadratic factor becomes

${\displaystyle x_{k+2}=(2^{32}+6\cdot 2^{16}+9)x_{k}=[6\cdot (2^{16}+3)-9]x_{k}}$

(because 2³² mod 2³¹ = 0) and allows us to show the correlation between three points as

${\displaystyle x_{k+2}=6x_{k+1}-9x_{k}.}$

Summing the absolute values of the coefficients, we get no more than 16 planes in 3D, becoming only 15 planes on closer examination, as shown in the diagram above. Even by the standards of LCGs, this shows that RANDU is terrible: using RANDU for sampling a unit cube will only sample 15 parallel planes, not even close to the upper limit of ${\displaystyle {\Big \lfloor }{\big (}2^{31}\times 3!{\big )}^{1/3}{\Big \rfloor }=2344}$ planes.

As a result of the wide use of RANDU in the early 1970s, many results from that time are seen as suspicious.^[6] This misbehavior was already detected in 1963^[7] on a 36-bit computer, and carefully reimplemented^{[clarification needed]} on the 32-bit IBM System/360. It was believed to have been widely purged by the early 1990s^[8] but there were still FORTRAN compilers using it as late as 1999.^[1]

Sample output

The start of the RANDU's output period for the initial seed ${\displaystyle V_{0}=1}$ is

1, 65539, 393225, 1769499, 7077969, 26542323, … (sequence A096555 in the OEIS).