Coincidences in generalized Lucas sequences
Abstract
For an integer k≥ 2, let (Ln(k))n be the k-generalized Lucas sequence which starts with 0,…,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 Ln(k)=Lm() in nonnegative integers n,k,m, with k, ≥ 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].
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.