English

Coincidences in generalized Lucas sequences

Number Theory 2014-02-18 v1

Abstract

For an integer k2k\geq 2, let (Ln(k))n(L_{n}^{(k)})_{n} be the kk-generalized Lucas sequence which starts with 0,,0,2,10,\ldots,0,2,1 (kk terms) and each term afterwards is the sum of the kk preceding terms. In this paper, we find all the integers that appear in different generalized Lucas sequences; i.e., we study the Diophantine equation Ln(k)=Lm()L_n^{(k)}=L_m^{(\ell)} in nonnegative integers n,k,m,n,k,m,\ell with k,2k, \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].

Keywords

Cite

@article{arxiv.1402.4085,
  title  = {Coincidences in generalized Lucas sequences},
  author = {Eric F. Bravo and Jhon J. Bravo and Florian Luca},
  journal= {arXiv preprint arXiv:1402.4085},
  year   = {2014}
}

Comments

14 pages

R2 v1 2026-06-22T03:09:54.362Z