scholarly journals On Fibonacci Numbers and its Applications

In this article, we explore the representation of the product of k consecutive Fibonacci numbers as the sum of kth power of Fibonacci numbers. We also present a formula for finding the coefficients of the Fibonacci numbers appearing in this representation. Finally, we extend the idea to the case of generalized Fibonacci sequence and also, we produce another formula for finding the coefficients of Fibonacci numbers appearing in the representation of three consecutive Fibonacci numbers as a particular case. Also, we point out some amazing applications of Fibonacci numbers.

2013 ◽  
Vol 09 (05) ◽  
pp. 1351-1366 ◽  
Author(s):  
JHON J. BRAVO ◽  
FLORIAN LUCA

Let P(m) denote the largest prime factor of an integer m ≥ 2, and put P(0) = P(1) = 1. For an integer k ≥ 2, let [Formula: see text] be the k-generalized Fibonacci sequence which starts with 0, …, 0, 1 (k terms) and each term afterwards is the sum of the k preceding terms. Here, we show that if n ≥ k+2, then [Formula: see text]. Furthermore, we determine all the k-Fibonacci numbers [Formula: see text] whose largest prime factor is less than or equal to 7.


Author(s):  
Yüksel Soykan

In this paper, closed forms of the summation formulas ∑nk=0 xkWmk+j for generalized Fibonacci numbers are presented. As special cases, we give summation formulas of Fibonacci, Lucas, Pell, Pell-Lucas, Jacobsthal, Jacobsthal-Lucas numbers. We present the proofs to indicate how these formulas, in general, were discovered. Of course, all the listed formulas may be proved by induction, but that method of proof gives no clue about their discovery. Moreover, we give some identities and recurrence properties of generalized Fibonacci sequence.


Integers ◽  
2009 ◽  
Vol 9 (5) ◽  
Author(s):  
D. G. Mohammad Farrokhi

AbstractWe first generalize an identity involving the generalized Fibonacci numbers and then apply it to establish some general identities concerning special sums. We also give a sufficient condition on a generalized Fibonacci sequence {


2020 ◽  
Vol 16 (07) ◽  
pp. 1643-1666
Author(s):  
Mahadi Ddamulira ◽  
Florian Luca

For an integer [Formula: see text], let [Formula: see text] be the [Formula: see text]-generalized Fibonacci sequence which starts with [Formula: see text] (a total of [Formula: see text] terms) and for which each term afterwards is the sum of the [Formula: see text] preceding terms. In this paper, we find all integers [Formula: see text] with at least two representations as a difference between a [Formula: see text]-generalized Fibonacci number and a power of [Formula: see text]. This paper continues the previous work of the first author for the Fibonacci numbers, and for the Tribonacci numbers.


2018 ◽  
Vol 13 (1) ◽  
pp. 27-45
Author(s):  
Anshika Srivastava ◽  
Ram Krishna Pandey ◽  
Om Prakash

Abstract This paper concerns the problem of determining or estimating the maximal upper density of the sets of nonnegative integers S whose elements do not differ by an element of a given set M of positive integers. We find some exact values and some bounds for the maximal density when the elements of M are generalized Fibonacci numbers of odd order. The generalized Fibonacci sequence of order r is a generalization of the well known Fibonacci sequence, where instead of starting with two predetermined terms, we start with r predetermined terms and each term afterwards is the sum of r preceding terms. We also derive some new properties of the generalized Fibonacci sequence of order r. Furthermore, we discuss some related coloring parameters of distance graphs generated by the set M.


2020 ◽  
Vol 26 (11-12) ◽  
pp. 1564-1578
Author(s):  
Jonathan García ◽  
Carlos A. Gómez ◽  
Florian Luca

2016 ◽  
Vol 67 (1) ◽  
pp. 41-46
Author(s):  
Pavel Trojovský

Abstract Let k ≥ 1 and denote (Fk,n)n≥0, the k-Fibonacci sequence whose terms satisfy the recurrence relation Fk,n = kFk,n−1 +Fk,n−2, with initial conditions Fk,0 = 0 and Fk,1 = 1. In the same way, the k-Lucas sequence (Lk,n)n≥0 is defined by satisfying the same recurrence relation with initial values Lk,0 = 2 and Lk,1 = k. These sequences were introduced by Falcon and Plaza, who showed many of their properties, too. In particular, they proved that Fk,n+1 + Fk,n−1 = Lk,n, for all k ≥ 1 and n ≥ 0. In this paper, we shall prove that if k ≥ 1 and $F_{k,n + 1}^s + F_{k,n - 1}^s \in \left( {L_{k,m} } \right)_{m \ge 1} $ for infinitely many positive integers n, then s =1.


Author(s):  
Rannyelly Rodrigues de Oliveira ◽  
Francisco Régis Vieira Alves ◽  
Rodrigo Sychocki da Silva

Resumo: O presente artigo apresenta uma abordagem de investigação no contexto da História da Matemática, envolvendo situações que visam oportunizar o entendimento da extensão, evolução e generalização de propriedades da Sequência de Fibonacci. Dessa forma, abordam-se duas situações. A primeira, envolvendo a descrição da fórmula de Binnet no campo dos inteiros. Logo em seguida, apresenta-se uma descrição e análise dos termos explícitos presentes na Sequência Polinomial de Fibonacci. O escopo da presente proposta de atividade busca a divulgação científica de noções envolvendo a generalização, ainda atual, fato que acentua o caráter ubíquo da Sequência de Fibonacci. À vista disso, a proposta de experimento didático está fundamentada na organização das características da Engenharia Didática. Almeja-se, além da validação interna das hipóteses levantadas durante a investigação, contribuir com a formação inicial de estudantes dos cursos de Licenciatura em Matemática que virem a estudar o tema.Palavras-chave: Atividades de investigação. Engenharia Didática. História da Matemática. Sequência Generalizada de Fibonacci.  THE STUDY OF MATHEMATICAL DEFINITIONS IN THE CONTEXT OF HISTORICAL RESEARCH: A DIDACTIC EXPERIMENT INVOLVING DIDACTIC ENGINEERING AND FIBONACCI POLYNOMIAL SEQUENCESAbstract: This article presents a research approach within the context of History of Mathematics, involving situations that aim to provide an understanding of the extension, evolution and generalization of properties of the Fibonacci Sequence. In this way, two situations are addressed. The first, involving the description of Binet's formula in the integer field. Then, a description and analysis of the explicit terms present in the Fibonacci Polynomial Sequence is presented. The scope of this activity proposal seeks the scientific dissemination of notions involving generalization, still current, a fact that accentuates the ubiquitous character of the Fibonacci Sequence. Thus the proposal of didactic experiment is based on the organized in the characteristics of Didactic Engineering, beyond the internal validation of the hypotheses raised during the investigation this paper aims at contributing to initial education of undergrad   Mathematicsof students that may come to study the subject.Keywords: Research activities. Didactic Engineering. History of Mathematics. Generalized Fibonacci Sequence.


KoG ◽  
2017 ◽  
pp. 26-34
Author(s):  
Gunter Weiss

Fibonacci sequence and the limit of the quotient of adjacent Fibonacci numbers, namely the Golden Mean, belong to general knowledge of almost anybody, not only of mathematicians and geometers. There were several attempts to generalize these fundamental concepts which also found applications in art and architecture, as e.g. number series and quadratic equations leading to the so-called ``Metallic means'' by V. de Spinadel [8] or the cubic ``plastic number'' by van der Laan [5] resp. the ``cubi ratio'' by L. Rosenbusch [7]. The mentioned generalisations consider series of integers or real numbers. ``Non-standard aspects'' now mean generalisations with respect to a given number field or ring as well as visualisations of the resulting geometric objects. Another aspect concerns Fibonacci type resp. Padovan type combinations of given start objects. Here it turns out that the concept ``Golden Mean'' or ``van der Laan Mean'' also makes sense for vectors, matrices and mappings.


Sign in / Sign up

Export Citation Format

Share Document