🔢 mathematics

Multiple Solutions to Exponential Diophantine Equations of Ramanujan-Nagell type: $Cz^2 = D + A.B^n$

This paper investigates exponential Diophantine equations of Ramanujan-Nagell type ( $Cz^2=D+A.B^n$ ) by summarizing known cases with multiple solutions and presenting a specific equation with four solutions, which is conjectured to be the unique non-trivial instance of its kind under certain constraints.

Original authors: Philip Gibbs

Published 2026-02-09

📖 5 min read🧠 Deep dive

CC BY 4.0

Original authors: Philip Gibbs

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 kind of number puzzle. The puzzle involves a simple-looking equation: $C \times z^2 = D + A \times B^n$ .

At first glance, it looks like a standard math problem, but it's actually a "Diophantine" equation. That's a fancy way of saying we are only allowed to use whole numbers (integers) for our answers. We aren't looking for decimals or fractions; we want perfect whole numbers that make the equation balance.

This paper, written by Philip Gibbs, is a deep dive into a specific family of these puzzles, known as Ramanujan-Nagell type equations. Here is the story of what the paper finds, explained without the heavy math jargon.

The Original Mystery: The Ramanujan-Nagell Equation

The story starts with a famous Indian mathematician named Srinivasa Ramanujan. In 1913, he posed a specific puzzle:

"For which values of $n$ is $2^n - 7$ a perfect square?"

He found five answers: $n = 3, 4, 5, 7, 15$ . He asked, "Are there any more?"
For 35 years, no one knew. Then, a mathematician named Nagell proved that no, there are no more. Those five were the only ones.

This specific puzzle is the "grandfather" of the family. The paper asks a natural follow-up question: If we change the numbers in the equation (the $A, B, C,$ and $D$ ), can we find other puzzles that have many solutions?

The Goal: Finding "Rich" Puzzles

Most of these number puzzles are "poor." They usually have zero solutions, or maybe just one or two. It's like looking for a needle in a haystack; most haystacks are empty.

The author's goal was to find the "golden haystacks"—equations that have multiple solutions (3, 4, 5, or even 6). He wanted to map out the landscape of these equations to see how common they are and if we can predict them.

The Tools: Elliptic Curves as a Map

To find these solutions, the author uses a powerful mathematical tool called Elliptic Curves.

The Analogy: Imagine the equation as a bumpy landscape. The "solutions" are the flat spots where you can stand.
The Method: The author uses a technique called Mordell 2-descent. Think of this as a special kind of "zoom lens" or a "folding map." It allows the mathematician to take a known solution and "double" it to find new ones, or to see how different solutions are connected.

By using this method, he can construct families of equations that are guaranteed to have at least three solutions, rather than just stumbling upon them by luck.

The Big Discoveries

The paper is essentially a massive catalog or a "phone book" of these number puzzles. The author sorts them based on the numbers used in the equation ( $A, B, C, D$ ) and counts how many solutions each one has.

Here are the key takeaways from his catalog:

The "Triple" Solution: Using his new method, he showed how to build equations that are guaranteed to have at least three solutions. He proved that if you pick certain starting numbers, you can create an infinite family of these "triple-solution" puzzles.
The "Quadruple" Champion: The author found a very rare equation:
$z^2 = 277,665 \times 176 + 34^n$
This specific puzzle has four solutions. The author suspects this might be the only equation of its specific type that has four solutions (unless the base number is a power of 2). It's a unique "unicorn" in the mathematical world.
The "Sextuple" Records: The paper lists the current record-holders. There are a few famous equations that have six solutions. For example:
- $z^2 + 119 = 2^n$
- $z^2 = 7 \times 2^{24} + 57 \times 2^n$
  These are the "champions" of the group. The paper confirms these are the only known ones with six solutions.

The "Primitive" Rule

The author had to be careful not to count the same puzzle twice.

The Analogy: Imagine you have a recipe for a cake. If you double all the ingredients, it's still the same cake, just bigger.
The Rule: He defined "Primitive Equations." These are the "original recipes" where the numbers can't be simplified or divided by a common factor. He ignores the "doubled" versions so that his list of unique puzzles is clean and accurate.

Summary of the Findings

The paper doesn't just list random numbers; it organizes them into a structured survey:

Negative vs. Positive: He looks at cases where the constant number ( $D$ ) is negative (like the original Ramanujan puzzle) and where it is positive.
Prime vs. Composite: He checks what happens when the base number ( $B$ ) is a prime number (like 2, 3, 5) versus a composite number (like 4, 6, 8).
The Count: For every combination, he lists the maximum number of solutions found so far.
- Most combinations have 0, 1, or 2 solutions.
- Finding 3 solutions is rare but doable.
- Finding 4, 5, or 6 solutions is extremely rare and usually requires very specific, large numbers.

The Bottom Line

Philip Gibbs has created a comprehensive guide to the "Ramanujan-Nagell" family of equations. He has:

Proved that there are infinite families of equations with at least three solutions.
Identified specific, rare equations that have four, five, or six solutions.
Conjectured (strongly guessed) that the equation $z^2 = 277,665 \times 176 + 34^n$ is the unique "four-solution" champion for its specific type.

The paper is a map for mathematicians, showing them where the "treasure" (multiple solutions) is buried and providing the tools to dig it up. It confirms that while most of these number puzzles are lonely (having few solutions), there are a few special ones that are surprisingly rich in answers.

Technical Summary: Multiple Solutions to Exponential Diophantine Equations of Ramanujan-Nagell Type

Problem Statement

The paper investigates exponential Diophantine equations of the Ramanujan-Nagell type, defined generally as:
$Cz^2 = D + A \cdot B^n$
where $A, B, C, D$ are fixed integers ( $A, D \neq 0, C > 0, |B| \ge 2$ ), and the goal is to find integer solutions $(z, n)$ . The primary focus is determining the number of solutions, denoted as $K(A, B, C, D)$ , for fixed parameters.

The study is motivated by the historical Ramanujan-Nagell equation ( $z^2 + 7 = 2^n$ ), where Ramanujan conjectured and Nagell later proved that there are exactly five solutions. The paper seeks to identify other equations of this form that possess multiple solutions (specifically $K \ge 2$ ), with a particular interest in finding equations with high multiplicities (e.g., $K \ge 4$ or $K \ge 6$ ).

Methodology

The author employs a combination of computational searches, analytic bounds, and advanced number-theoretic techniques:

Primitive Equations: To avoid trivial infinite families, the paper defines "primitive" equations based on specific conditions regarding square-free parts and greatest common divisors of the coefficients. Non-primitive cases are treated as derived from smaller primitive equations.
Counting Conjectures: The paper proposes asymptotic upper bounds for the number of $D$ values that yield at least one solution within a range $D_M$ . These bounds are derived heuristically by counting integer points on the curve $Cz^2 = D + A \cdot B^n$ .
Algebraic Construction for Multiple Solutions:
- Double Solutions ( $K \ge 2$ ): The author derives a formula to construct $D$ values that yield at least two solutions by factorizing the difference between two exponential terms.
- Triple Solutions ( $K \ge 3$ ): A novel application of Mordell's 2-descent on elliptic curves is introduced. By mapping the problem to an elliptic curve $y^2 = (x+a)(x+b)(x+c)$ , the author utilizes the doubling theorem to generate families of equations with three solutions. This approach identifies rational points on the curve that correspond to integer solutions of the Diophantine equation.
Computational Survey: The paper conducts extensive computational searches across various parameter ranges (varying $A, B, C, D$ ) to catalog known equations with high solution counts.

Key Contributions and Results

1. Theoretical Framework

Mordell 2-Descent Application: The paper provides a distinct method for constructing families of equations with triple solutions using the tangent method on elliptic curves, differing from previous methods that relied solely on algebraic number theory or $p$ -adic analysis.
Primitive Definition: A rigorous definition of primitive equations is established to standardize the search for unique cases with multiple solutions.

2. Computational Cataloging

The paper presents detailed tables surveying known equations with multiple solutions, categorized by the values of $B$ (prime vs. composite) and the sign of $D$ :

$B=2$ : The paper confirms the existence of equations with up to 6 solutions. Notable examples include:
- $z^2 + 119 = 2^n$ ( $K=6$ )
- $z^2 = 7 \cdot 2^{24} + 57 \cdot 2^n$ ( $K=6$ )
- $z^2 = 6601 \cdot 2^2 + 165 \cdot 2^n$ ( $K=6$ )
$B$ is an Odd Prime: Equations with up to 5 solutions are identified, often involving specific families where $A=4$ .
$B$ is Composite: The survey identifies equations with 4 solutions for composite $B$ .

3. Specific Discoveries and Conjectures

New Quadruple Solution: The paper identifies the equation $z^2 = 277665 \cdot 17^6 + 34^n$ (noted as $z^2 = 277665 \cdot 17^6 + 34^n$ in the text, though the notation $34^n$ likely implies $34 \cdot 17^n$ or similar based on context, the text explicitly writes $34^n$ in the abstract but the table lists $B=34$ ). Correction based on text: The abstract states: "the equation $z^2 = 277665 \cdot 17^6 + 34^n$ is found to have four solutions." (Note: The text likely implies $B=34$ or a specific structure, but the abstract explicitly names the equation).
Uniqueness Conjecture: The author conjectures that the equation $z^2 = 277665 \cdot 17^6 + 34^n$ is the only non-trivial equation of Ramanujan-Nagell type with four solutions where $A=C=1$ and $B$ is not a power of 2.
Infinite Families: The paper lists infinite families of equations with 5 solutions where $B=2$ and $D>0$ .

Significance and Claims

The paper positions itself as a survey and a computational exploration rather than a proof of completeness for all cases. Its significance lies in:

Systematization: Providing a structured overview of equations with multiple solutions across different parameter sets ( $A, B, C, D$ ).
Methodological Innovation: Introducing the application of Mordell's 2-descent to construct triple-solution families, offering a new perspective on the structure of these equations.
Identification of Extremes: Highlighting specific equations with high solution counts (up to 6) and proposing a conjecture regarding the uniqueness of the four-solution case for non-power-of-2 bases.

The author explicitly states that the goal is not to prove that all solutions are found for specific cases, but rather to "uncover new equations with high solution counts" and to present summaries of multiple solutions for different cases. The paper acknowledges that while many cases are well-studied (e.g., $B=2, D<0$ ), the general case with composite $B$ or positive $D$ remains less understood and offers fertile ground for further discovery.