arXiv:1402.4085 [math.NT]AbstractReferencesReviewsResources
Coincidences in generalized Lucas sequences
Eric F. Bravo, Jhon J. Bravo, Florian Luca
Published 2014-02-17Version 1
For an integer $k\geq 2$, let $(L_{n}^{(k)})_{n}$ be the $k-$generalized Lucas sequence which starts with $0,\ldots,0,2,1$ ($k$ terms) and each term afterwards is the sum of the $k$ preceding terms. In this paper, we find all the integers that appear in different generalized Lucas sequences; i.e., we study the Diophantine equation $L_n^{(k)}=L_m^{(\ell)}$ in nonnegative integers $n,k,m,\ell$ with $k, \ell\geq 2$. The proof of our main theorem uses lower bounds for linear forms in logarithms of algebraic numbers and a version of the Baker-Davenport reduction method. This paper is a continuation of the earlier work [4].
Comments: 14 pages
Categories: math.NT
Related articles: Most relevant | Search more
arXiv:2202.13182 [math.NT] (Published 2022-02-26)
On solutions of the Diophantine equation $L_n+L_m=3^a$
arXiv:1409.8514 [math.NT] (Published 2014-09-30)
Powers of two as sums of two $k-$Fibonacci numbers
arXiv:2206.10356 [math.NT] (Published 2022-06-14)
Sums of Fibonacci numbers close to a power of 2