Coincidences in generalized Lucas sequences

preprint2014arXivOpen access

Abstract

For an integer k≥2k\geq 2, let (Ln(k))n(L_{n}^{(k)})_{n} be the k−k-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].

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.