Loading...
Please wait, while we are loading the content...
Generating Pseudo-Random Numbers by Shuffling a Fibonacci Sequence
| Content Provider | Scilit |
|---|---|
| Author | Gebhardt, Friedrich |
| Copyright Year | 1967 |
| Description | M. D. MacLaren and G. Marsaglia [2] 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 ${\chi ^2} -$ tests of the maximum and minimum of two to ten sì³®ding numbers and tests applied to sequences immediately following a small number or two almost equal ones. |
| Related Links | https://www.ams.org/mcom/1967-21-100/S0025-5718-1967-0223064-6/S0025-5718-1967-0223064-6.pdf |
| Ending Page | 709 |
| Page Count | 2 |
| Starting Page | 708 |
| ISSN | 00255718 |
| e-ISSN | 10886842 |
| DOI | 10.2307/2005015 |
| Journal | Mathematics of Computation |
| Issue Number | 100 |
| Volume Number | 21 |
| Language | English |
| Publisher | Duke University Press |
| Access Restriction | Open |
| Subject Keyword | Pseudo Random Numbers Number Generators Tests Applied Fibonacci Sequence |
| Content Type | Text |
| Resource Type | Article |
| Subject | Applied Mathematics Algebra and Number Theory Computational Mathematics |
