Author:
Pethö Attila,Szalay László
Abstract
In this paper, we provide an explicit upper bound on the absolute value of the solutions n < m < 0 to the Diophantine equation F(k)n = ±F(k)m, assuming k is even. Here {F(k)n}n ∈ Z denotes the k-generalized Fibonacci sequence. The upper bound depends only on k.
Publisher
Universidad Nacional de Colombia
Reference7 articles.
1. E. F. Bravo, C. A. Gómez, and F. Luca, Total multiplicity of the Tribonacci sequence, Colloq. Math. 159 (2020), 71-76.
2. E. F. Bravo, C. A. Gómez, F. Luca, A. Togbé, and B. Kafle, On a conjecture about total multiplicity of Tribonacci sequence, Colloq. Math. 159 (2020), 61-69.
3. G. P. B. Dresden and Z. Du, A simplified Binet formula for k-generalized Fibonacci numbers, J. Integer Seq. 17 (2014), Article 14.4.7, 9pp.
4. A. Dubickas, On the distance between two algebraic numbers, Bull. Malays. Math. Sci. Soc. 43 (2020), 3049-3064.
5. C. A. Gómez and F. Luca, On the zero-multiplicity of a fifth-order linear recurrence, Int. J. Number Theor. 15 (2019), 585-595.
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Common Values of Padovan and Perrin Sequences;Mediterranean Journal of Mathematics;2023-07-17