Javascript must be enabled to continue!
Some Properties of the Fibonacci Sequence
View through CrossRef
The purposes of this paper are; (a) to develop a relationship between subscripts of the symbols of Fibonacci and Lucas numbers and the numbers themselves; (b) to develop relationships between selected modulo and the lengths of the periods of the non-negative residue classes of several general Fibonacci sequences; and (c) to show, through the use of continued fractions, that certain Diophantine equations have solutions in Fibonacci numbers. General terms for the Fibonacci and Lucas sequences are developed through the use of differential equations. These general terms are then used to show that any Fibonacci or Lucas number is a function of its subscript. The length of the periods of the least non-negative residue classes for a given modulus is considered and is found to be the same for any of the general Fibonacci sequences. The exception is the Lucas sequence modulo five. The length of its period is a multiple of the selected general Fibonacci sequences modulo five. It is further shown that a Diophantine equation of the form fx ± ty = c where f and t are either consecutive Fibonacci or consecutive Lucas numbers, has a solution in Fibonacci numbers.
Title: Some Properties of the Fibonacci Sequence
Description:
The purposes of this paper are; (a) to develop a relationship between subscripts of the symbols of Fibonacci and Lucas numbers and the numbers themselves; (b) to develop relationships between selected modulo and the lengths of the periods of the non-negative residue classes of several general Fibonacci sequences; and (c) to show, through the use of continued fractions, that certain Diophantine equations have solutions in Fibonacci numbers.
General terms for the Fibonacci and Lucas sequences are developed through the use of differential equations.
These general terms are then used to show that any Fibonacci or Lucas number is a function of its subscript.
The length of the periods of the least non-negative residue classes for a given modulus is considered and is found to be the same for any of the general Fibonacci sequences.
The exception is the Lucas sequence modulo five.
The length of its period is a multiple of the selected general Fibonacci sequences modulo five.
It is further shown that a Diophantine equation of the form fx ± ty = c where f and t are either consecutive Fibonacci or consecutive Lucas numbers, has a solution in Fibonacci numbers.
Related Results
Beauty of Plants and Flowers Obeys Fibonacci Sequences
Beauty of Plants and Flowers Obeys Fibonacci Sequences
The aim of the study is to test the hypothesis that plants or flowers exhibiting Fibonacci sequences with larger numbers possess greater aesthetic beauty. As the number of Fibonacc...
On Matrices with Bidimensional Fibonacci Numbers
On Matrices with Bidimensional Fibonacci Numbers
Abstract
In this paper, the bidimensional extensions of the Fibonacci numbers are explored, along with a detailed examination of their properties, characteristics, a...
Pauli Gaussian Fibonacci and Pauli Gaussian Lucas Quaternions
Pauli Gaussian Fibonacci and Pauli Gaussian Lucas Quaternions
We have investigated new Pauli Fibonacci and Pauli Lucas quaternions by taking the components of these quaternions as Gaussian Fibonacci and Gaussian Lucas numbers, respectively. W...
Fibonacci Type Semigroups
Fibonacci Type Semigroups
We study “Fibonacci type” groups and semigroups. By establishing asphericity of their presentations we show that many of the groups are infinite. We combine this with Adjan graph t...
Around the Fibonacci Numeration System
Around the Fibonacci Numeration System
Let 1, 2, 3, 5, 8, … denote the Fibonacci sequence beginning with 1 and 2, and then setting each subsequent number to the sum of the two previous ones. Every positive integer n can...
Tri–Periodic Fibonacci Numbers and Tri–Periodic Leonardo Numbers
Tri–Periodic Fibonacci Numbers and Tri–Periodic Leonardo Numbers
In this study, we explore the properties of tri-periodic Fibonacci and tri-periodic Leonardo number sequences. Then we derive generating function of these sequences and give Binet'...
Tri–Periodic Fibonacci Numbers and Tri–Periodic Leonardo Numbers
Tri–Periodic Fibonacci Numbers and Tri–Periodic Leonardo Numbers
In this study, we explore the properties of tri-periodic Fibonacci and tri-periodic Leonardo number sequences. Then we derive generating function of these sequences and give Binet'...
Cholesky Factorization of the Generalized Symmetric k- Fibonacci Matrix
Cholesky Factorization of the Generalized Symmetric k- Fibonacci Matrix
Matrix methods are a useful tool while dealing with many problems stemming from linear recurrence relations. In this paper, we discuss factorizations and inverse factorizations of ...

