Abstract
In this paper, we find all the solutions of the title Diophantine equation in positive integer variables (n, m, a), where Fk is the kth term of the Fibonacci sequence. The proof of our main theorem uses lower bounds for linear forms in logarithms (Baker's theory) and a version of the Baker-Davenport reduction method in diophantine approximation.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
