Generalized Fibonacci – Like Sequence Associated with Fibonacci and Lucas Sequences

Gupta, Yash P.; Singh, Mamta; Sikhwal, Omprakash

doi:10.12691/tjant-2-6-9

Cited by 5 publications

(1 citation statement)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The Fibonacci sequence is given by F n = 0,1,1,2,3,5,8,13………n. Any change in the initial value or recurrence relation or both results to further generalized Fibonacci sequence {q n } (Kalman and Mena 2002;Gupta, Panwar and OSikhwal 2012;Gupta, Singh and Sikhwal 2014;M. Edson and O. Yayenie 2009).…”

Section: Related Literaturementioning

confidence: 99%

A Better Approach to Generating Random Numbers

Nachandiya

Mamza

2019

Math. J. Interdiscip. Sci.

View full text Add to dashboard Cite

The term random number has been used by many scholars to explain the behaviour of a stochastic system. Many of such scholars with statistical or mathematical background view it as an organized set of numbers produced by a function in a numerical way in which the next number to be produced is unknown or unpredictable. This paper produced software that generates a sequence of random number and also compared the algorithm with the commonly used method of random number generator. The three most common methods selected were the Mid Square method, Fibonacci method and Linear Congruential Generator Method (LCG). The result shows that the LCG provides a more acceptable result in terms of speed, long cycle, uniformity and independenceApplications of this random numbers can be seen in Monte Carlo simulations, simulation or modelling, password generation, cryptography, and online games.

show abstract

Section: Related Literaturementioning

confidence: 99%