In this paper, we consider the Diophantine equation for given integers b, c with , whereas varies among Lucas-Lehmer sequences of the second kind. We prove under some technical conditions that if the considered equation has at least three solutions (n, m) , then there is an upper bound on the size of the solutions as well as on the size of the coefficients in the characteristic polynomial of .
Keywords: Diophantine equations; Lucas sequences; Pillai’s Problem.
© The Author(s) 2024.