scholarly journals On the Reciprocal Sums of Products of Two Generalized Bi-Periodic Fibonacci Numbers

Mathematics ◽  
2021 ◽  
Vol 9 (2) ◽  
pp. 178
Author(s):  
Younseok Choo
Keyword(s):  
Recurrence Relation ◽  
Fibonacci Numbers ◽  
Sums Of Products ◽  
Reciprocal Sums

This paper concerns the properties of the generalized bi-periodic Fibonacci numbers {Gn} generated from the recurrence relation: Gn=aGn−1+Gn−2 (n is even) or Gn=bGn−1+Gn−2 (n is odd). We derive general identities for the reciprocal sums of products of two generalized bi-periodic Fibonacci numbers. More precisely, we obtain formulas for the integer parts of the numbers ∑k=n∞(a/b)ξ(k+1)GkGk+m−1,m=0,2,4,⋯, and ∑k=n∞1GkGk+m−1,m=1,3,5,⋯.

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 Algebraic relations for reciprocal sums of Fibonacci numbers

2007 ◽  
Vol 130 (1) ◽  
pp. 37-60 ◽  
Author(s):  
Carsten Elsner ◽  
Shun Shimomura ◽  
Iekata Shiokawa
Keyword(s):  
Fibonacci Numbers ◽  
Reciprocal Sums

scholarly journals Transcendence of Rogers-Ramanujan continued fraction and reciprocal sums of Fibonacci numbers

1997 ◽  
Vol 73 (7) ◽  
pp. 140-142 ◽  
Author(s):  
Daniel Duverney ◽  
Keiji Nishioka ◽  
Kumiko Nishioka ◽  
Iekata Shiokawa
Keyword(s):  
Continued Fraction ◽  
Fibonacci Numbers ◽  
Reciprocal Sums

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 .

Algebraic relations for reciprocal sums of odd terms in Fibonacci numbers

2007 ◽  
Vol 17 (3) ◽  
pp. 429-446 ◽  
Author(s):  
C. Elsner ◽  
S. Shimomura ◽  
I. Shiokawa
Keyword(s):  
Fibonacci Numbers ◽  
Reciprocal Sums

scholarly journals On the reciprocal sums of products of Fibonacci and Lucas numbers

Filomat ◽  
2018 ◽  
Vol 32 (8) ◽  
pp. 2911-2920 ◽  
Author(s):  
Ginkyu Choi ◽  
Younseok Choo
Keyword(s):  
Lucas Numbers ◽  
Fibonacci And Lucas Numbers ◽  
Sums Of Products ◽  
Reciprocal Sums

In this paper, we study the reciprocal sums of products of Fibonacci and Lucas numbers. Some identities are obtained related to the numbers ??,k=n 1/FkLk+m and ??,k=n 1/LkFk+m, m ? 0.

Sign in / Sign up

Export Citation Format

Share Document