Abstract
Let be a non-degenerate binary recurrence sequence with positive discriminant. Let be fixed prime numbers and be fixed non-negative integers. In this paper, we obtain the finiteness result for the solution of the Diophantine equation under certain assumptions. Moreover, we explicitly solve the equation , in non-negative integers with . The main tools used in this work are the lower bound for linear forms in logarithms and the Baker-Davenport reduction method.
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.