Fibonacci Numbers and Vieta Jumping for a Rational Diophantine Equation
Steven J. Miller, Dimitrios Nikolakopoulos, Anitha Srinivasan

TL;DR
This paper classifies solutions to a specific rational Diophantine equation using Vieta jumping, revealing connections to Fibonacci numbers and showing that the parameter k can only be 3 or 4.
Contribution
It completely characterizes positive integer solutions to the equation, linking them to Fibonacci numbers and identifying the limited possible values of k.
Findings
k can only be 3 or 4
Solution pairs relate to Fibonacci numbers
The ratio (a+b)/gcd(a,b)^2 takes values 1, 2, 3, 5
Abstract
We study the Diophantine equation , where is an integer. Using Vieta jumping, we completely classify all positive integer pairs . We prove that the associated integer value can only be or . The corresponding solution pairs are related to the classical Fibonacci numbers. As a consequence, the quantity takes only the values and . This reveals an unexpected connection between a simple rational Diophantine condition, Vieta jumping, and Fibonacci numbers.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
