A Pillai-Catalan-type problem involving Fibonacci numbers
Abstract
This paper addresses A Pillai-Catalan-type problem assosiated with Fibonacci numbers. Let Fn be the Fibonacci numbers defined by the recurrence relation F1=1, F2=1 and Fn=Fn-1+Fn-2 for all n≥ 3. We will find all positive integer solution to the equation 3x-Fn2y=1 using properties of Fibonacci numbers, linear forms of logarithms, and the Baker-Davenport reduction method.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.