2020
DOI: 10.3390/math8061010
|View full text |Cite
|
Sign up to set email alerts
|

A Quadratic Diophantine Equation Involving Generalized Fibonacci Numbers

Abstract: The sequence of the k-generalized Fibonacci numbers ( F n ( k ) ) n is defined by the recurrence F n ( k ) = ∑ j = 1 k F n − j ( k ) beginning with the k terms 0 , … , 0 , 1 . In this paper, we shall solve the Diophantine equation F n ( k ) = ( F m ( l ) ) 2 + 1 , in positive integers m , n , k and l.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2

Citation Types

0
2
0

Year Published

2020
2020
2022
2022

Publication Types

Select...
4

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(2 citation statements)
references
References 18 publications
(22 reference statements)
0
2
0
Order By: Relevance
“…A recent study by Blankers et al considers the dynamics of Julia sets over hyperbolic numbers [17]. Chaves and Trojovský studied quadratic Diophantine equations using generalized Fibonacci numbers [18]. In their work, they use the fact that this can be thought of in terms of consecutive values of an orbit in a quadratic dynamics related to the Mandelbrot set.…”
Section: Introductionmentioning
confidence: 99%
“…A recent study by Blankers et al considers the dynamics of Julia sets over hyperbolic numbers [17]. Chaves and Trojovský studied quadratic Diophantine equations using generalized Fibonacci numbers [18]. In their work, they use the fact that this can be thought of in terms of consecutive values of an orbit in a quadratic dynamics related to the Mandelbrot set.…”
Section: Introductionmentioning
confidence: 99%
“…Let k be a fixed positive integer greater than or equal to two. Dafnis, Philippou, and Livieris [10] generalized (1) to the Fibonacci and Lucas numbers of order k (for the definitions of the Fibonacci and Lucas numbers of order k, we refer to [3,11], respectively; see, also, [7,12,13]), deriving the following identity by means of color tiling.…”
Section: Introductionmentioning
confidence: 99%