Abstract
Let be a fixed non-degenerate binary recurrence sequence with positive discriminant, a fixed non-zero integer and fixed, distinct prime numbers. In this paper we consider the Diophantine equation and prove under mild technical restrictions effective finiteness results. In particular we give explicit upper bounds for and . Furthermore, we provide a rather efficient algorithm to solve Diophantine equations of the described type and we demonstrate our method by an example.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.