arXiv:2205.13168 [math.NT]AbstractReferencesReviewsResources
On the Exponential Diophantine Equation $(F_{m+1}^{(k)})^x-(F_{m-1}^{(k)})^x = F_n^{(k)}$
Hayat Bensella, Bijan Kumar Patel, Djilali Behloul
Published 2022-05-26Version 1
In this paper, we explicitly find all solutions of the title Diophantine equation, using lower bounds for linear forms in logarithms and properties of continued fractions. Further, we use a version of the Baker-Davenport reduction method in Diophantine approximation, due to Dujella and Peth\"o. This paper extends the previous work of \cite{Patel}.
Categories: math.NT
Related articles: Most relevant | Search more
arXiv:2202.13182 [math.NT] (Published 2022-02-26)
On solutions of the Diophantine equation $L_n+L_m=3^a$
arXiv:1811.03015 [math.NT] (Published 2018-11-02)
An exponential Diophantine equation related to the difference between powers of two consecutive Balancing numbers
arXiv:2001.10265 [math.NT] (Published 2020-01-28)
On the exponential Diophantine equation related to powers of two consecutive terms of Lucas sequences