Abstract
Let $$u_n$$ be a fixed non-degenerate binary recurrence sequence with positive discriminant, w a fixed non-zero integer and $$p_1,p_2,\ldots ,p_s$$ fixed, distinct prime numbers. In this paper we consider the Diophantine equation $$u_n+u_m=w p_1^{z_1} \ldots p_s^{z_s}$$ and prove under mild technical restrictions effective finiteness results. In particular we give explicit upper bounds for n, m and $$z_1, \ldots , z_s$$ . Furthermore, we provide a rather efficient algorithm to solve Diophantine equations of the described type and we demonstrate our method by an example.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.