The Dying Rabbit Problem Revisited

Integers ◽  
2009 ◽  
Vol 9 (2) ◽  
Author(s):  
Antonio M. Oller-Marcén
Keyword(s):  
Recurrence Relation ◽  
Characteristic Polynomial ◽  
Fibonacci Sequence ◽  
General Term ◽  
Technical Requirement ◽  
Positive Real ◽  
Real Roots

AbstractIn this paper we study a generalization of the Fibonacci sequence in which rabbits are mortal and take more that two months to become mature. In particular we give a general recurrence relation for these sequences (improving the work in [Hoggat and Lind, Fibonacci Quart. 7: 482–487, 1969]) and we calculate explicitly their general term (extending the work in [Miles, Amer. Math. Monthly 67: 745–752, 1960]). In passing, and as a technical requirement, we also study the behavior of the positive real roots of the characteristic polynomial of the considered sequences.

scholarly journals Determinant Representations of Polynomial Sequences of Riordan Type

2013 ◽  
Vol 2013 ◽  
pp. 1-6 ◽  
Author(s):  
Sheng-liang Yang ◽  
Sai-nan Zheng
Keyword(s):  
Recurrence Relation ◽  
Characteristic Polynomial ◽  
Chebyshev Polynomials ◽  
General Term ◽  
Polynomial Sequence ◽  
Polynomial Sequences ◽  
Principal Submatrix ◽  
Riordan Array

In this paper, using the production matrix of a Riordan array, we obtain a recurrence relation for polynomial sequence associated with the Riordan array, and we also show that the general term for the sequence can be expressed as the characteristic polynomial of the principal submatrix of the production matrix. As applications, a unified determinant expression for the four kinds of Chebyshev polynomials is given.

scholarly journals On the Sum of Powers of Two k-Fibonacci Numbers which Belongs to the Sequence of k-Lucas Numbers

2016 ◽  
Vol 67 (1) ◽  
pp. 41-46
Author(s):  
Pavel Trojovský
Keyword(s):  
Recurrence Relation ◽  
Initial Conditions ◽  
Fibonacci Numbers ◽  
Fibonacci Sequence ◽  
Lucas Numbers ◽  
Initial Values ◽  
Lucas Sequence ◽  
Positive Integers

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.

scholarly journals Some Diophantine Problems Related to k-Fibonacci Numbers

Mathematics ◽  
2020 ◽  
Vol 8 (7) ◽  
pp. 1047
Author(s):  
Pavel Trojovský ◽  
Štěpán Hubálovský
Keyword(s):  
Recurrence Relation ◽  
Diophantine Equations ◽  
Initial Conditions ◽  
Fibonacci Numbers ◽  
Fibonacci Sequence ◽  
Recursive Relation ◽  
Initial Values ◽  
Lucas Sequence ◽  
Diophantine Problems ◽  
Positive Integers

Let k ≥ 1 be an integer and denote ( F k , n ) n as the k-Fibonacci sequence whose terms satisfy the recurrence relation F k , n = k F k , n − 1 + F k , n − 2 , with initial conditions F k , 0 = 0 and F k , 1 = 1 . In the same way, the k-Lucas sequence ( L k , n ) n is defined by satisfying the same recursive relation with initial values L k , 0 = 2 and L k , 1 = k . The sequences ( F k , n ) n ≥ 0 and ( L k , n ) n ≥ 0 were introduced by Falcon and Plaza, who derived many of their properties. In particular, they proved that F k , n 2 + F k , n + 1 2 = F k , 2 n + 1 and F k , n + 1 2 − F k , n − 1 2 = k F k , 2 n , for all k ≥ 1 and n ≥ 0 . In this paper, we shall prove that if k > 1 and F k , n s + F k , n + 1 s ∈ ( F k , m ) m ≥ 1 for infinitely many positive integers n, then s = 2 . Similarly, that if F k , n + 1 s − F k , n − 1 s ∈ ( k F k , m ) m ≥ 1 holds for infinitely many positive integers n, then s = 1 or s = 2 . This generalizes a Marques and Togbé result related to the case k = 1 . Furthermore, we shall solve the Diophantine equations F k , n = L k , m , F k , n = F n , k and L k , n = L n , k .

scholarly journals From Fibonacci Sequence to the Golden Ratio

2013 ◽  
Vol 2013 ◽  
pp. 1-3 ◽  
Author(s):  
Alberto Fiorenza ◽  
Giovanni Vincenzi
Keyword(s):  
Characteristic Polynomial ◽  
Golden Ratio ◽  
Fibonacci Sequence ◽  
Maximum Modulus ◽  
Point Of View ◽  
General Point ◽  
Constant Coefficients ◽  
The Difference ◽  
New Perspective

We consider the well-known characterization of the Golden ratio as limit of the ratio of consecutive terms of the Fibonacci sequence, and we give an explanation of this property in the framework of the Difference Equations Theory. We show that the Golden ratio coincides with this limit not because it is the root with maximum modulus and multiplicity of the characteristic polynomial, but, from a more general point of view, because it is the root with maximum modulus and multiplicity of a restricted set of roots, which in this special case coincides with the two roots of the characteristic polynomial. This new perspective is the heart of the characterization of the limit of ratio of consecutive terms of all linear homogeneous recurrences with constant coefficients, without any assumption on the roots of the characteristic polynomial, which may be, in particular, also complex and not real.

scholarly journals Fibonacci, tribonacci, …, hexanacci and parallel “error-free” machine arithmetic

2019 ◽  
Vol 43 (6) ◽  
pp. 1072-1078 ◽  
Author(s):  
V.M. Chernov
Keyword(s):  
Characteristic Polynomial ◽  
Fibonacci Sequence ◽  
Parallel Computations ◽  
New Method ◽  
Direct Sum ◽  
Number Systems ◽  
Residue Number Systems ◽  
Residue Number ◽  
The Difference ◽  
Free Machine

The paper proposes a new method of synthesis of machine arithmetic systems for “error-free” parallel computations. The difference of the proposed approach from calculations in traditional Residue Number Systems (RNS) for the direct sum of rings is the parallelization of calculations in finite reductions of non-quadratic global fields whose elements are represented in number systems generated by sequences of powers of roots of the characteristic polynomial for the n-Fibonacci sequence.

Prime factors in generalised Fibonacci sequences - a question posed by Gill Hatch

2003 ◽  
Vol 87 (509) ◽  
pp. 203-208
Author(s):  
R. P. Burn
Keyword(s):  
Recurrence Relation ◽  
Fibonacci Sequence ◽  
Prime Factors ◽  
Fibonacci Sequences ◽  
Positive Integers

Those who enjoy number patterns will no doubt have had many hours of pleasure exploring the Fibonacci sequence to various moduli, and especially in recognising the regularity with which various prime factors occur in thesequence (see [1]). Gill Hatch’s question is whether the occurrence of prime factors in generalised Fibonacci sequences is similarly predictable. Generalised Fibonacci sequences (Gn), abbreviated to GF sequences, are sequences of positive integers derived from the recurrence relation tn + 2 = tn + 1 + tn. In the case of the Fibonacci sequence (Fn), the first two terms are 1 and 1.

New encryption scheme using k-Fibonacci-like sequence

2021 ◽  
pp. 2250037
Author(s):  
Saida Lagheliel ◽  
Abdelhakim Chillali ◽  
Ahmed Ait Mokhtar
Keyword(s):  
Elliptic Curve ◽  
Elliptic Curves ◽  
Recurrence Relation ◽  
Fibonacci Sequence ◽  
Encryption Scheme ◽  
Lucas Sequence

In this paper, we present a new encryption scheme using generalization k-Fibonacci-like sequence, we code the points of an elliptic curve with the terms of a sequence of k-Fibonacci-like using of Fibonacci sequence and we call it as k-Fibonacci like sequence [Formula: see text] defined by the recurrence relation: [Formula: see text] and we present some relation among k-Fibonacci like sequence, k-Fibonacci sequence and k-Lucas sequence. After that, we give application of elliptic curves in cryptography using k-Fibonacci like sequence.

Characteristic Polynomial in Assessment of Carbon-Nano Structures

2017 ◽  
pp. 122-147
Author(s):  
Sorana D. Bolboacă ◽  
Lorentz Jäntschi
Keyword(s):  
Characteristic Polynomial ◽  
Chemical Structure ◽  
Chair Conformation ◽  
Point Of View ◽  
Characteristic Polynomials ◽  
Graph Invariant ◽  
Real Roots ◽  
Nano Structures ◽  
Central Form ◽  
Number Of Real Roots

Six dodecahedrane assemblies as multiple of five and respectively six structures were constructed and investigated from the topological point of view. The investigation was conducted using characteristic polynomials, graph invariant encoding important properties of the graph of the chemical structure. The assemblies of 5, 6, 15 and 25 dodecahedranes proved to have the center in the same plane while the assemblies of 12 and 24 dodecahedranes degenerated from the planar central form to a chair conformation. Generally, the number of real roots of characteristic polynomials is equal to the number of atoms in the assembly. The obtained roots of the characteristic polynomial were split into intervals and the frequency apparition spectra were simulated. The obtained spectra were used to investigate the behavior of investigated assembly.

scholarly journals On the arrowhead-Fibonacci numbers

2016 ◽  
Vol 14 (1) ◽  
pp. 1104-1113 ◽  
Author(s):  
Inci Gültekin ◽  
Ömür Deveci
Keyword(s):  
Characteristic Polynomial ◽  
Fibonacci Numbers ◽  
Fibonacci Sequence ◽  
Cyclic Groups ◽  
Generating Matrix ◽  
Arrowhead Matrix

AbstractIn this paper, we define the arrowhead-Fibonacci numbers by using the arrowhead matrix of the characteristic polynomial of the k-step Fibonacci sequence and then we give some of their properties. Also, we study the arrowhead-Fibonacci sequence modulo m and we obtain the cyclic groups from the generating matrix of the arrowhead-Fibonacci numbers when read modulo m. Then we derive the relationships between the orders of the cyclic groups obtained and the periods of the arrowhead-Fibonacci sequence modulo m.

Sign in / Sign up

Export Citation Format

Share Document