**RANDU**^{[1]} is a linear congruential pseudorandom number generator (LCG) of the Park–Miller type, which has been used since the 1960s.^{[2]} It is defined by the recurrence:

with the initial seed number, as an odd number. It generates pseudorandom integers which are uniformly distributed in the interval [1, 2^{31} − 1], but in practical applications are often mapped into pseudorandom rationals in the interval (0, 1), by the formula:

- .

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, and every integer result is odd. However, at least eight low-order bits are dropped when converted to single-precision (32 bit, 24 bit mantissa) floating-point.

The reason for choosing these particular values is that with a 32-bit-integer word size, the arithmetic of mod 2^{31} and calculations could be done quickly, using special features of some computer hardware.

## Problems with multiplier and modulus

In general, when an LCG with modulus 2^{31} is used to produce points (x_{k}, x_{k+1}, x_{k+2}) in 3-dimensional space, the points fall into no more than 2,344 parallel planes,^{[5]} a result which indicates an LCG is unsuitable for Monte Carlo simulation. Choice of multiplier determines the number of planes. To show the problem with the values of multiplier 65539 and modulus 2^{31} chosen for RANDU, consider the following calculation where every term should be taken mod 2^{31}. Start by writing the recursive relation as:

which becomes, after expanding the quadratic factor:

- because 2
^{32}mod 2^{31}= 0

and allows us to show the correlation between three points as:

As a result of this correlation, each point lies in one of a set of parallel planes 2^{31} apart, 15 of which intersect the 2^{31} x 2^{31} x 2^{31} cube containing the points. 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 is:

## References

- ^
^{a}^{b}Compaq Fortran Language Reference Manual (Order Number: AA-Q66SD-TK) September 1999 (formerly DIGITAL Fortran and DEC Fortran 90) **^**Entacher, Karl (June 2000). "A collection of classical pseudorandom number generators with linear structures - advanced version". Archived from the original on 18 November 2018.**^**Knuth D.E.*The Art of Computer Programming*, Volume 2:*Seminumerical Algorithms*, Second Edition. Addison-Wesley, 1981. ISBN 0-201-03822-6. Section 3.3.4, p. 104. "its very name RANDU is enough to bring dismay into the eyes and stomachs of many computer scientists!" [Extensive coverage of statistical tests for non-randomness.]**^**Knuth (1998), p. 188**^**Marsaglia, George (1968). "Random Numbers Fall Mainly in the Planes".*Proc. Natl. Acad. Sci. U.S.A*.**61**(1): 25–28. doi:10.1073/pnas.61.1.25. PMC 285899. PMID 16591687.**^**Press, William H.; et al. (1992).*Numerical Recipes in Fortran 77: The Art of Scientific Computing*(2nd ed.). ISBN 0-521-43064-X.**^**ref. 7 of http://portal.acm.org/citation.cfm?id=363827**^**Interview with Donald Knuth

## External links

Wikiquote has quotations related to: RANDU |