Fibonacci Random Number Generator using Lehmer’s Algorithm
| dc.contributor.author | Oduwole, H.K. | |
| dc.contributor.author | Shehu, Sunusi Lalin | |
| dc.contributor.author | Adegoke, G.K. | |
| dc.contributor.author | Onubogu, J.L. | |
| dc.date.accessioned | 2025-12-18T12:12:19Z | |
| dc.date.available | 2025-12-18T12:12:19Z | |
| dc.date.issued | 2013-03-01 | |
| dc.description.abstract | The uniqueness of Fibonacci sequence is been discussed with particular emphasis on its application to random number generation. The Lehmer’s algorithm was employed using fibonacci prime. For multiplier a 912 , initial seed x0 415 , modulus m 28657 and multiplier a 518 , initial seed x0 211 , modulus m 514229 , we generate random numbers with full period m1 . This suggest that higher values of Fibonacci primes with appropriate choice of a full multiplier a , modulus m (fibonacci prime) and a starting seed x0 will produce a full period with finite countable many random numbers. A run test also indicates that the random numbers generated using modulus m as fibonacci prime are truly random | en_US |
| dc.identifier.citation | Shehu, S.L. Et. al. (2013). Fibonacci Random Number Generator using Lehmer’s Algorithm | en_US |
| dc.identifier.uri | http://localhost:8080/xmlui/handle/123456789/10567 | |
| dc.language.iso | en | en_US |
| dc.publisher | Department of Mathematics, Nasarawa State University, Keffi | en_US |
| dc.subject | Fibonacci sequence, Fibonacci prime, Random numbers generator, Lehmer’s Algorithm, run test | en_US |
| dc.title | Fibonacci Random Number Generator using Lehmer’s Algorithm | en_US |
| dc.type | Article | en_US |
Files
Original bundle
1 - 1 of 1
Loading...
- Name:
- Fibonacci Random No. Generator Using Lehmer's Algorithm.pdf
- Size:
- 622.48 KB
- Format:
- Adobe Portable Document Format
- Description:
- Article
License bundle
1 - 1 of 1
Loading...
- Name:
- license.txt
- Size:
- 1.71 KB
- Format:
- Item-specific license agreed upon to submission
- Description:
