Results 61 to 70 of about 1,467 (207)
An identity for the Fibonacci and Lucas numbers [PDF]
In this paper we prove an identity between sums of reciprocals of Fibonacci and Lucas numbers. The Fibonacci numbers are defined for all n ≥ 0 by the recurrence relation Fn + 1 = Fn + Fn-1 for n ≥ 1, where F0 = 0 and F1 = 0. The Lucas numbers Ln are defined for all n ≥ 0 by the same recurrence relation, where L0 = 2 and L1 = 1 We prove the following ...
openaire +2 more sources
The Lucas collocation approach is used in this study to approximate a fractional‐order financial crime model (FOFCM) numerically. The model categorizes the population into five groups: persons without a financial criminal past, those inclined toward financial crimes, active participants, individuals undergoing prosecution, and those imprisoned.
Mahmoud Abd El-Hady +4 more
wiley +1 more source
Fibonacci numbers and Lucas numbers
Neste trabalho, exploramos os números de Fibonacci e de Lucas. A maioria dos resultados históricos sobre esses números são apresentados e provados. Ao longo do texto, um grande número de identidades a respeito dos números de Fibonacci e de Lucas são ...
Silva, Bruno Astrolino e
core +1 more source
Non-Fisherian generalized Fibonacci numbers [PDF]
Using biology as inspiration, this paper explores a generalization of the Fibonacci sequence that involves gender biased sexual reproduction. The female, male, and total population numbers along with their associated recurrence relations are considered ...
Thor Martinsen
doaj +1 more source
On the Generalized Order-$k$ Fibonacci and Lucas Numbers
In this paper we consider the generalized order-k Fibonacci and Lucas numbers. We give the generalized Binet formula, combinatorial representation and some relations involving the generalized order-k Fibonacci and Lucas numbers.
Kiliç, Emrah, Taşci, Dursun
openaire +4 more sources
Leonardo Cartan Numbers and Related Fibonacci–Lucas Structures
This paper investigates the Leonardo Cartan numbers, defined as an extension of the classical Leonardo sequence through additional algebraic structures. The recurrence relations of these numbers are established, and various summation formulas are derived.
Hasan Çakır +2 more
wiley +1 more source
On sums of k-generalized Fibonacci and k-generalized Lucas numbers as first and second kinds of Thabit numbers [PDF]
Let (Fᵣ⁽ᵏ⁾)ᵣ≥2-k and (Lᵣ⁽ᵏ⁾)ᵣ≥2-k be generalizations of the Fibonacci and Lucas sequences, where k≥2. For these sequences the initial k terms are 0,0,...,0, 1 and 0,0,...,2,1, and each subsequent term is the sum of the preceding k terms.
Hunar Sherzad Taher, Saroj Kumar Dash
doaj +1 more source
Let G be a connected graph. A subset S⊆V(G) is called a general position set of a graph G if no shortest path in G contains more than two vertices from S. Likewise, a subset X⊆E(G) is an edge general position set if no shortest path contains more than two edges from X.
Zahra Hamed-Labbafian +2 more
wiley +1 more source
Novel Expressions for Certain Generalized Leonardo Polynomials and Their Associated Numbers
This article introduces new polynomials that extend the standard Leonardo numbers, generalizing Fibonacci and Lucas polynomials. A new power form representation is developed for these polynomials, which is crucial for deriving further formulas.
Waleed Mohamed Abd-Elhameed +3 more
doaj +1 more source
This study establishes a novel algebraic connection between Horadam numbers and the split quaternion algebra. To this end, two fundamental constructs are introduced: the Fibonacci Sq,r‐split quaternions and the Horadam sq,r‐split quaternions, which generalize Horadam numbers within the framework of split quaternions.
İskender Öztürk +2 more
wiley +1 more source

