Generating pseudo-random numbers by shuffling a Fibonacci sequence
Abstract: M. D. MacLaren and G. Marsaglia  have proposed to mix two pseudo-random number generators in the following way: The first generator is used at the beginning to fill an array with pseudo-random numbers; whenever a random number is needed, the second generator determines which element of the array is to be used and replaced by a new number from the first generator. In this study, only one generator is utilized for both purposes; moreover, the generator chosen (a Fibonacci sequence) is by itself a rather poor one. Nevertheless, the final sequence of pseudo-random numbers passed all statistical tests applied to it, including tests of the maximum and minimum of two to ten succeeding numbers and tests applied to sequences immediately following a small number or two almost equal ones.
-  M. Greenberger, "Method in randomness," Comm. ACM, v. 8, 1965, pp. 177-179.
-  M. Donald MacLaren and George Marsaglia, Uniform random number generators, J. Assoc. Comput. Mach. 12 (1965), 83–89. MR 0170449, https://doi.org/10.1145/321250.321257
-  D. D. Wall, Fibonacci series modulo 𝑚, Amer. Math. Monthly 67 (1960), 525–532. MR 0120188, https://doi.org/10.2307/2309169
- M. Greenberger, "Method in randomness," Comm. ACM, v. 8, 1965, pp. 177-179.
- M. D. MacLaren & G. Marsaglia, "Uniform random number generators," J. Assoc. Comput. Mach., v. 12, 1965, pp. 83-89. MR 30 #687. MR 0170449 (30:687)
- D. D. Wall, "Fibonacci series modulo m," Amer. Math. Monthly, v. 67, 1960, pp. 525-532. MR 22 #10945. MR 0120188 (22:10945)
Retrieve articles in Mathematics of Computation with MSC: 65.15
Retrieve articles in all journals with MSC: 65.15