Loading...
Please wait, while we are loading the content...
Similar Documents
Generating pseudo-random numbers by shuffling a Fibonacci sequence
| Content Provider | Semantic Scholar |
|---|---|
| Author | Gebhardt, Friedrich |
| Copyright Year | 1967 |
| Abstract | 1. Summary. 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 x2tests 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. |
| Starting Page | 708 |
| Ending Page | 709 |
| Page Count | 2 |
| File Format | PDF HTM / HTML |
| DOI | 10.1090/S0025-5718-1967-0223064-6 |
| Volume Number | 21 |
| Alternate Webpage(s) | http://www.ams.org/journals/mcom/1967-21-100/S0025-5718-1967-0223064-6/S0025-5718-1967-0223064-6.pdf |
| Alternate Webpage(s) | https://doi.org/10.1090/S0025-5718-1967-0223064-6 |
| Language | English |
| Access Restriction | Open |
| Content Type | Text |
| Resource Type | Article |
