Linearly Recursive Sequences of Fibonacci Numbers
Author:
SANJAY HARNE1, V.H.BADSHAH2 and SHUBHRAJ PAL3
Affiliation:
1Department of Mathematics, Govt. Holkar Science College, Indore, M.P. (India)
2School of Studies in Mathematics, Vikram University, Ujjain, M.P. (India)
3Department of Mathematics, P.M.B. Gujarati Science College, Indore, M.P. (India)
Keyword:
Fibonacci sequence
Issue Date:
April 2015
Abstract:
The Fibonacci sequence is based on an additive relationship between any term and the three preceding terms. We shall make it a linear dependence and it will involve the preceding r terms. Here and throughout, q will note the general additive sequence. qn+r = a1q n+r-1+ a2qn+r-2 + … + arqn (n = 0, 1, 2, 3, …)
Pages:
ISSN:
2319-8052 (Online) - 2231-3478 (Print)
Source:
DOI:
Share This:
Copy the following to cite this article:
SANJAY HARNE1, V.H.BADSHAH2 and SHUBHRAJ PAL3, "Linearly Recursive Sequences of Fibonacci Numbers", Journal of Ultra Scientist of Physical Sciences, Volume 27, Issue 1, Page Number , 2016Copy the following to cite this URL:
SANJAY HARNE1, V.H.BADSHAH2 and SHUBHRAJ PAL3, "Linearly Recursive Sequences of Fibonacci Numbers", Journal of Ultra Scientist of Physical Sciences, Volume 27, Issue 1, Page Number , 2016Available from: http://www.ultraphysicalsciences.org/paper/311/
This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License
