Sebastian Heintze, Volker Ziegler
Published 2023-09-20Version 1
In this paper we consider the Diophantine equation $ V_n - b^m = c $ for given integers $ b,c $ with $ b \geq 2 $, whereas $ V_n $ 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 $ V_n $.
On the Diophantine Equation $p^x + p^y = z^{2n}$
The Diophantine Equation $x^4 + 2 y^4 = z^4 + 4 w^4$---a number of improvements
On the Diophantine equation $f(x)=2f(y)$
![QR code for arXiv:2309.11173 [math.NT]](http://oss.arxitics.com/images/favicon.svg)