🔢 mathematics

Fibonacci Numbers and Vieta Jumping for a Rational Diophantine Equation

This paper employs Vieta jumping to prove that the Diophantine equation $\frac{a+1}{b} + \frac{b+1}{a} = k$ admits positive integer solutions only when $k$ is 3 or 4, with all such solution pairs being intrinsically linked to Fibonacci numbers.

Original authors: Steven J. Miller, Dimitrios Nikolakopoulos, Anitha Srinivasan

Published 2026-05-20

📖 5 min read🧠 Deep dive

CC BY 4.0

Original authors: Steven J. Miller, Dimitrios Nikolakopoulos, Anitha Srinivasan

Original paper licensed under CC BY 4.0 (http://creativecommons.org/licenses/by/4.0/). ✨ This is an AI-generated explanation of the paper below. It is not written or endorsed by the authors. For technical accuracy, refer to the original paper. Read full disclaimer

Imagine you are a detective trying to solve a very specific number puzzle. The puzzle involves two positive whole numbers, let's call them A and B. The rule is that if you take A, add 1, and divide by B, then do the same thing in reverse (B plus 1 divided by A), and add those two results together, you must get a whole number, which we'll call K.

The equation looks like this:
$\frac{A+1}{B} + \frac{B+1}{A} = K$

The authors of this paper, Steven Miller, Dimitrios Nikolakopoulos, and Anitha Srinivasan, set out to answer two big questions:

What whole numbers can K actually be?
What are all the possible pairs of A and B that make this work?

Here is the breakdown of their findings, explained with some everyday analogies.

The "Vieta Jump" Elevator

To solve this, the authors used a mathematical technique called Vieta Jumping. Think of this like an elevator in a building where every floor represents a different pair of numbers $(A, B)$ that solves the puzzle.

The Rules of the Elevator: If you are on a floor with a pair $(A, B)$ , the math of the equation guarantees there is a "partner" floor you can jump to. You can swap the numbers (flip them) or use a specific formula to find a new number that pairs with one of your current numbers.
Going Down: The magic of this method is that you can always use these jumps to go down to a floor with smaller numbers. You keep jumping down, getting smaller and smaller, until you hit the "ground floor."
The Ground Floor: The authors proved that no matter where you start, if you keep jumping down, you eventually hit one of only two specific "ground floor" pairs:
- The pair (1, 1), which only works if K = 4.
- The pair (2, 2), which only works if K = 3.

The Big Discovery: Because every possible solution connects back to one of these two starting points, the authors proved that K can never be anything other than 3 or 4. If you try to make K equal to 5, or 2, or 100, you will find no whole number solutions exist.

The Fibonacci Connection

Once they knew the only possible starting points were (1,1) and (2,2), they asked: "If we jump up from these starting points, what numbers do we get?"

They found that the numbers generated are deeply connected to the Fibonacci sequence (the famous series where each number is the sum of the two before it: 1, 1, 2, 3, 5, 8, 13...).

For K = 3: The solutions are pairs like (2, 2), (3, 2), (6, 3), (14, 6), and so on. These numbers are essentially "Fibonacci numbers plus 1."
For K = 4: The solutions are pairs like (1, 1), (2, 1), (6, 2), (21, 6), and so on. These follow a similar pattern but with a slightly different rhythm.

It's like finding that every path in a giant maze leads back to a central garden, and the flowers growing along the paths are arranged in a perfect, predictable pattern known to mathematicians for centuries.

The "Greatest Common Divisor" Secret

The paper also looked at a specific calculation involving these numbers: $\frac{A+B}{(\text{Greatest Common Divisor of A and B})^2}$ .

Think of the "Greatest Common Divisor" (GCD) as the largest "building block" that can perfectly measure both numbers A and B. The authors found that no matter which solution pair you pick, this specific calculation always results in one of the first four Fibonacci numbers: 1, 2, 3, or 5.

If K = 3, the result is always 1 or 5.
If K = 4, the result is always 2 or 3.

This is a surprising link between a simple algebraic rule and a famous number sequence.

What Happens When You Change the Rules?

The authors also tested what happens if you change the "1" in the equation to a "2" (making the equation $\frac{A+2}{B} + \frac{B+2}{A} = K$ ).

The Elevator Breaks: In the original puzzle, the "jump down" always worked. With the "2" rule, the jump down sometimes fails to produce a whole number or doesn't get smaller. The elevator gets stuck or breaks.
New Possibilities: They found that for this harder version, K could be 3, 4, or 6.
Three Variables: When they tried to add a third number (A, B, and C) to the mix, the whole system became chaotic. The "jumps" often resulted in fractions instead of whole numbers, and the neat, connected families of solutions fell apart into disjoint groups.

Summary

In short, this paper is a mathematical treasure hunt. It proved that a specific rational equation only works for two very specific target numbers (3 and 4). It showed that all the solutions to these equations are generated by a simple "jumping" process that traces back to the famous Fibonacci numbers. It also highlighted that while this method works beautifully for two numbers, it becomes messy and unpredictable if you try to apply it to three numbers or change the constants in the equation.

Technical Summary: Fibonacci Numbers and Vieta Jumping for a Rational Diophantine Equation

Problem Statement
The paper investigates positive integer solutions $(a, b)$ to the rational Diophantine equation:
$\frac{a+1}{b} + \frac{b+1}{a} = k$
where $k$ is an integer. The authors aim to completely classify all such pairs $(a, b)$ , determine the possible integer values of $k$ , and analyze the arithmetic structure of the solutions, specifically the quantity $\frac{a+b}{\gcd(a, b)^2}$ .

Methodology
The primary analytical tool employed is Vieta jumping, a technique used to generate new integer solutions to quadratic Diophantine equations from existing ones. The authors define two operations on a solution pair $(a, b)$ :

Flipping: Swapping coordinates to $(b, a)$ .
Vieta Jumping: Treating the equation as a quadratic in one variable (e.g., $a$ ) while fixing the other ( $b$ ). If $a$ is a root, Vieta's formulas provide a second root $a' = kb - 1 - a$. The pair $(a', b)$ is also a solution.

The proof strategy involves a descent argument. The authors demonstrate that for any non-diagonal solution (where $a \neq b$ ), one can apply Vieta jumping to the larger coordinate to produce a new solution with a strictly smaller sum of coordinates. By iterating this process, any solution must eventually reduce to a "diagonal" solution where $a = b$ . Conversely, starting from these minimal diagonal solutions, all other solutions can be generated by reversing the jump (increasing the coordinate sum) and applying flips.

Key Results

Classification of $k$ :
The paper proves that the equation admits positive integer solutions if and only if $k = 3$ or $k = 4$ .
- For $k \leq 2$ , no solutions exist (proven via the AM-GM inequality).
- For $k > 4$ , the descent process fails to terminate in a valid diagonal solution, implying no solutions exist.
Structure of Solutions:
- Case $k=3$ : The minimal solution is $(2, 2)$ . All other solutions are generated by Vieta jumps and flips from this seed. The authors establish a direct correspondence with the Fibonacci sequence $\{F_n\}$ . Specifically, for $a \leq b$ , solutions are of the form:
  $a = F_{2n-1} + 1, \quad b = F_{2n+1} + 1$
  for $n \geq 0$ . This sequence corresponds to OEIS A032908.
- Case $k=4$ : The minimal solution is $(1, 1)$ . All solutions are generated from this seed. The sequence of solutions corresponds to OEIS A101879.
Arithmetic Properties (Theorem 1.2):
The authors analyze the quantity $Q = \frac{a+b}{\gcd(a, b)^2}$ . They prove that for all solutions, $Q$ takes values exclusively from the set $\{1, 2, 3, 5\}$ , which are the first four Fibonacci numbers.
- If $k=3$ , $Q \in \{1, 5\}$ .
- If $k=4$ , $Q \in \{2, 3\}$ .

Significance and Claims
The paper claims to provide the first complete proof in the literature linking the solutions of this specific rational Diophantine equation to the Fibonacci sequence, despite the sequence A032908 being identified with these solutions in the OEIS. The work reveals an "unexpected connection" between a simple rational condition, the method of Vieta jumping, and Fibonacci numbers.

Furthermore, the authors present new results regarding the greatest common divisor structure of the solutions, specifically the behavior of $\gcd(a, b)$ and the resulting integer values of the normalized sum $\frac{a+b}{\gcd(a, b)^2}$ .

Limitations and Open Problems
The paper concludes by discussing the limitations of the Vieta jumping method when generalized:

Generalized Parameter $r$ : For the equation $\frac{a+r}{b} + \frac{b+r}{a} = k$ with $r \geq 3$ , the descent argument (proving $a' < a$ ) breaks down, and the integrality of the new root is not guaranteed to lead to a finite chain of solutions. The case $r=2$ is analyzed, yielding possible $k \in \{3, 4, 6\}$ .
Multi-variable Cases: In three or more variables (e.g., $\frac{a+r}{b} + \frac{b+r}{c} + \frac{c+r}{a} = k$ ), the recursive structure often fails to preserve integrality, and solutions may split into disjoint families not connected by Vieta jumps.
Open Questions: The paper notes that the general problem for $r \geq 2$ and $m \geq 3$ variables, as well as generalizations involving polynomials $f_i(a_i)$ , remains open.

The "Vieta Jump" Elevator

The Fibonacci Connection

The "Greatest Common Divisor" Secret

What Happens When You Change the Rules?

Summary

More like this