arXiv:2401.06555 [math.NT]AbstractReferencesReviewsResources
On a problem of Pillai involving S-units and Lucas numbers
Herbert Batte, Mahadi Ddamulira, Juma Kasozi, Florian Luca
Published 2024-01-12Version 1
Let $ \{L_n\}_{n\geq 0} $ be the sequence of Lucas numbers. In this paper, we look at the exponential Diophantine equation $L_n-2^x3^y=c$, for $n,x,y\in \mathbb{Z}_{\ge0}$. We treat the cases $c\in -\mathbb{N}$, $c=0$ and $c\in \mathbb{N}$ independently. In the cases that $c\in \mathbb{N}$ and $c\in -\mathbb{N}$, we find all integers $c$ such that the Diophantine equation has at least three solutions. These cases are treated independently since we employ quite different techniques in proving the two cases.
Comments: 28 pages
Categories: math.NT
Related articles: Most relevant | Search more
arXiv:2212.14247 [math.NT] (Published 2022-12-29)
Fibonacci and Lucas numbers as products of three repdigits in base $g$
arXiv:1802.09195 [math.NT] (Published 2018-02-26)
An exponential diophantine equation related to odd perfect numbers
arXiv:2205.13168 [math.NT] (Published 2022-05-26)
On the Exponential Diophantine Equation $(F_{m+1}^{(k)})^x-(F_{m-1}^{(k)})^x = F_n^{(k)}$