Fibonacci Random Number Generator using Lehmer’s Algorithm

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 , initial seed, modulus and multiplier, initial seed, modulus , we generate random numbers with full period . This suggest that higher values of Fibonacci primes with appropriate choice of a full multiplier , modulus (fibonacci prime) and a starting seed  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

Keywords: Fibonacci sequence, Fibonacci prime, Random numbers generator, Lehmer’s Algorithm, run test