Answers are grounded in this paper and cite their sources.
Marsaglia and Bray [1] recommend incorporating two-line random number generators directly into FORTRAN programs. One of the advantages of this is the time saved in avoiding linkage to and fro from a subroutine. Implicit in their FORTRAN routine for IBM 360 for Lehmer's multiplicative congruence method, namely; U k +1 = λ U k (mod P ), X k +1 = U k +1 / P is the use of 2 32 as the value of modulus P .
No takes yet. Share an insight, caveat, or question.
Dominic S. Seraphin (1969) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: