🔢 mathematics

On $k$ -th power Diophantine triples of the form $\{a^k, b, c\}$

The paper proves that for $k \geq 3$ , there are no Diophantine triples of the form $\{a^k, b, c\}$ where $c > 1$ .

Original authors: Clemens Fuchs, Miriam Schönauer

Published 2026-04-28

📖 4 min read🧠 Deep dive

Original authors: Clemens Fuchs, Miriam Schönauer

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

The Mystery of the Perfect Power Trios: A Simple Explanation

Imagine you are playing a mathematical game of "Connect the Dots." In this game, you have a set of numbers, and the rule is that if you pick any two numbers from your set, multiply them together, and add $1$, the result must be a "Perfect Power."

A Perfect Power is a number that is a result of a number being multiplied by itself several times. For example:

Squares ( $k=2$ ): $4$ (which is $2 \times 2$ ), $9 $($ 3 \times 3 $),$ 16 $($ 4 \times 4$).
Cubes ( $k=3$ ): $8 $($ 2 \times 2 \times 2 $),$ 27 $($ 3 \times 3 \times 3$).
Higher Powers ( $k=4, 5, \dots$ ): $16 $($ 2^4 $),$ 32 $($ 2^5$), and so on.

For centuries, mathematicians have been obsessed with finding "Diophantine m-tuples"—sets of numbers that follow this rule. For a long time, people were looking for "Squares" ( $k=2$ ). They found sets like $\{1, 3, 8, 120\}$ , where any two numbers multiplied plus one equals a square.

The Question This Paper Asks:
If we change the rules and demand that the result must be a higher power (like a cube or a 4th power), can we find a "Triple" (a set of three numbers) that follows a very specific pattern? Specifically, can we find a set $\{a^k, b, c\}$ where the first number is already a $k$ -th power?

The Answer:
The authors, Clemens Fuchs and Miriam Schönauer, have proven that it is impossible. In the world of higher powers, these specific types of "Perfect Trios" simply do not exist.

The Metaphor: The "Unstable Bridge"

To understand why this is hard to find, imagine you are trying to build a bridge using three massive stone pillars: A, B, and C.

The Rule of Connection: For the bridge to be stable, the connection between A and B, the connection between B and C, and the connection between A and C must all be "perfectly shaped" (the Perfect Power rule).
The Growing Gap: The paper shows that as you try to pick numbers that satisfy the first connection (A and B), the third pillar (C) has to be placed astronomically far away to make the math work.
The Mathematical "Snap": The authors use a technique called "Rational Approximation" (think of this as a high-precision measuring tape). They show that as you try to place pillar C, the requirements for it to be a "Perfect Power" become so incredibly strict and so specific that the number "snaps." The math demands that C be in two places at once, or that it be larger than the universe itself.

How They Proved It (The "Detective Work")

The researchers didn't just guess; they used three main "detective tools":

The Gap Principle (The Social Distancing Rule): They proved that if these numbers existed, they couldn't be close neighbors. They would have to be "socially distanced" by massive, astronomical gaps.
Continued Fractions (The Zoom Lens): They used a mathematical tool called "continued fractions" to zoom in on the numbers. It’s like using a microscope to look at the decimal points of a number. They showed that if you zoom in far enough, the "perfect" pattern required by the rule disappears.
Computer Power (The Heavy Lifter): For the few "edge cases" where the math was too tricky for a human to solve on paper, they handed the problem to a computer (using a program called Sagemath). The computer checked the remaining possibilities and confirmed: "Nope, nothing here either."

Why Does This Matter?

While it might seem like a game of "number hide-and-seek," this research is part of a larger effort to understand the DNA of numbers. By proving what cannot exist, mathematicians map out the boundaries of the mathematical universe. It’s like discovering a continent that is physically impossible to land on—it helps us understand the shape of the world we can live in.

Technical Summary: On $k$ -th Power Diophantine Triples of the Form $\{a^k, b, c\}$

Authors: Clemens Fuchs and Miriam Schönauer
Subject Area: Number Theory (Diophantine Equations, Rational Approximation)

1. The Problem

The paper investigates a generalization of the classical Diophantine $m$ -tuples. A set of $m$ positive integers is a Diophantine $m$ -tuple if the product of any two distinct elements increased by 1 is a perfect square ( $a_i a_j + 1 = x^2$ ).

The authors extend this concept to $k$ -th power Diophantine $m$ -tuples, where the product of any two elements plus one must be a perfect $k$ -th power ( $a_i a_j + 1 = x^k$ ) for $k \geq 3$ . Specifically, the paper focuses on the existence of triples (sets of three integers) of a very specific form: $\{a^k, b, c\}$ , where $1 < a^k < b < c$ .

2. Methodology

The authors employ a multi-faceted approach combining analytical number theory, Diophantine approximation, and computational verification. The proof strategy is divided into three main branches based on the value of $k$ :

Diophantine Approximation (The Hypergeometric Method): For $k \geq 5$ , the authors use results from Bennett regarding the approximation of algebraic numbers by rationals. They establish a relationship between the elements of the triple and a rational approximation of $\sqrt[k]{1 + \frac{1}{a^k b}}$ .
Gap Principles and Continued Fractions: For the lower values of $k$ ( $k=3$ and $k=4$ ), the standard approximation bounds are not strong enough to yield an immediate contradiction. The authors introduce "gap principles"—inequalities that force the elements $b$ and $c$ to be significantly larger than $a$ . They then prove that the ratio $\frac{a^{2t}}{s}$ must be a convergent of the infinite simple continued fraction expansion of $\sqrt[k]{a^k b}$ .
Computational Verification: For small values of $r$ (where $r^k = a^k b + 1$ ) that cannot be ruled out by analytical bounds, the authors use Sagemath to perform exhaustive computer calculations of continued fraction expansions to resolve the remaining finite cases.

3. Key Contributions and Results

The central result of the paper is Theorem 1.1:

Theorem: Let $k \geq 3$ and $1 < a < b < c$ be integers with $a^k < b < c$ . There exists no $k$ -th power Diophantine triple of the form $\{a^k, b, c\}$ .

Breakdown of the proof results:

Case $k \geq 5$ (Prime): The authors prove that the growth requirements for $c$ relative to $a$ and $b$ lead to a direct contradiction using Lemma 2.1 (a specialized bound on rational approximations).
Case $k = 4$ : The authors derive a gap principle showing that $s > 3r^3 z$ (where $s^4 = a^4 c + 1$ ). By analyzing the convergents of the continued fraction of $\sqrt[4]{r^4 - 1}$ , they show that the required partial quotients are too large to exist within the established bounds.
Case $k = 3$ : This is the most complex case. The authors use the known structure of the continued fraction expansion of $\sqrt[3]{r^3 - 1}$ to show that the index of the convergent must be large. They then narrow the possible values of $r$ to a finite set and use computational methods to eliminate them.

4. Significance

This paper contributes to the long-standing effort to bound the size of Diophantine $m$ -tuples. While previous research (such as by Bugeaud, Dujella, and Bennett) established absolute bounds for the size of $m$ in $k$ -th power sets, this paper provides a definitive "non-existence" result for a specific, structured class of triples.

By proving that the form $\{a^k, b, c\}$ cannot exist for any $k \geq 3$ , the authors refine our understanding of the constraints imposed by perfect power requirements on the products of integers, effectively closing a specific gap in the classification of $k$ -th power Diophantine sets.