<link rel="stylesheet" href="styles.f3b1fba60ec7970c.css">
Nasarawa State University, KeffiNasarawa State University, KeffiInstitutional Repository

Fibonacci Random Number Generator using Lehmer’s Algorithm

Loading...
Thumbnail Image

Journal Title

Journal ISSN

Volume Title

Publisher

Department of Mathematics, Nasarawa State University, Keffi

DOI

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 m1 . 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

Description

Citation

Shehu, S.L. Et. al. (2013). Fibonacci Random Number Generator using Lehmer’s Algorithm

Collections

Endorsement

Review

Supplemented By

Referenced By