Abstract: Terai presented the following conjecture: If $a^2 + b^2 = c^2$ with $a, b, c > 0$, $\gcd(a, b, c) = 1$, and $a$ is even, then the Diophantine equation $x^2 + b^m = c^n$ has only the positive integral solution $(x, m, n) = (a, 2, 2)$. This paper provides proofs for specific cases of this conjecture, particularly focusing on prime power components and modular constraints.
Introduction
In the study of Diophantine equations—equations where solutions are restricted to integers—Pythagorean triples ($a, b, c$ such that $a^2 + b^2 = c^2$) serve as a fundamental starting point. In 1956, Jeśmanowicz conjectured that for any primitive Pythagorean triple, the equation $a^x + b^y = c^z$ has only the solution $(2, 2, 2)$.
In 1993, Nobuhiro Terai proposed a significant variation: for a primitive Pythagorean triple where $a$ is even, the equation $x^2 + b^m = c^n$ should possess only the trivial solution $(x, m, n) = (a, 2, 2)$. Proving the absence of non-trivial solutions is a complex challenge in number theory. This 1998 study expands the conditions under which Terai’s conjecture can be rigorously proven.
Methodological Framework
The authors utilize a classical analytical approach grounded in algebraic number theory to constrain the possible values of the exponents $m$ and $n$. The methodology involves several key steps:
- Parametrization: The triples are represented using the standard form $a = 2st, b = s^2 - t^2, c = s^2 + t^2$, where $s$ and $t$ are coprime integers of opposite parity.
- Jacobi Symbols and Modular Arithmetic: A central component of the proof involves the use of Jacobi symbols to evaluate modular congruences. This technique is used to demonstrate that for the equation to hold under specific conditions, the exponents $m$ and $n$ must be even.
- Reduction to Known Forms: Once $m$ and $n$ are established as even, the original equation is transformed into specific Diophantine forms, such as $x^2 + 1 = 2y^n$.
- Application of Established Lemmas: The authors build upon the work of Størmer, Ljunggren, and Cao, applying existing theorems that define the bounds and solutions for these reduced equations.
Key Insights
The Role of Parity and Prime Powers
A major hurdle in these proofs is showing that $m$ and $n$ cannot be odd. By proving parity, the equation $x^2 + b^m = c^n$ can be treated as a difference of squares or a higher-order power equation, which is significantly more manageable. Furthermore, by assuming $b$ or $c$ is a prime power (e.g., $3, 5, 7, 25, 27$), the authors leverage the unique factorization of integers to eliminate potential non-trivial solutions that might arise if the bases were highly composite.
Modular Constraints
The research highlights the importance of the condition $c \equiv 5 \pmod 8$. When the hypotenuse $c$ leaves a remainder of 5 when divided by 8, it creates specific constraints in modular arithmetic that effectively "lock" the possible values of the exponents, supporting the uniqueness of the $(a, 2, 2)$ solution.
Core Theorems
The paper establishes two primary results that broaden the known validity of Terai’s conjecture:
- Theorem 1: If $b$ is a prime power and $c \equiv 5 \pmod 8$, Terai’s conjecture holds. This leads to a corollary providing a concrete formula for families of equations: $x^2 + (2k+1)^m = (2k^2 + 2k + 1)^n$ has only the solution $(2k^2+2k, 2, 2)$ provided $2k+1$ is prime and $k$ satisfies specific modular conditions.
- Theorem 2: If $c$ is a prime power and $c \equiv 5 \pmod 8$, Terai’s conjecture holds.
Conclusion and Future Directions
While these results significantly expand the "safe zones" for Terai’s conjecture, they are not exhaustive. The reliance on $c \equiv 5 \pmod 8$ leaves the case of $c \equiv 1 \pmod 8$ (the only other possibility for an odd $c$ in a primitive triple) unaddressed. Additionally, the general conjecture suggests the result should hold for any primitive triple, regardless of whether $b$ or $c$ are prime powers. Future research continues to seek the removal of these modular and primality constraints to provide a universal proof for the conjecture.
Summary updated