🔢 mathematics

On Regular Higher Power Rational Diophantine Triples

This paper investigates rational Diophantine triples where the product of any two elements plus one is a perfect fourth power, successfully constructing infinitely many such triples with positive elements while also addressing the challenges of extending this method to sixth and eighth powers.

Original authors: Alen Andrašek

Published 2026-04-21

📖 5 min read🧠 Deep dive

CC BY 4.0

Original authors: Alen Andrašek

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 master architect trying to build a very specific kind of bridge. The rules of your bridge are strange: if you take any two pillars (numbers) and multiply them together, then add a single brick (the number 1), the total weight must be a perfect square.

For centuries, mathematicians have been building these "square bridges" (called Diophantine triples). They found many examples, like the set $\{1, 3, 8, 120\}$ . If you multiply any two of these and add 1, you get a perfect square (e.g., $1 \times 3 + 1 = 4$ , which is $2^2$ ).

The New Challenge: The "Fourth-Power" Bridge
In this paper, the author, Alen Andrašek, asks a much harder question: What if the result isn't just a square, but a fourth power?

A square is like $2^2 = 4$ .
A fourth power is like $2^4 = 16$ .

So, the new rule is: Multiply any two numbers, add 1, and the result must be a number like 16, 81, 256, etc. (numbers that can be written as $n^4$ ).

The Main Discovery

The author successfully built infinite families of these "fourth-power bridges." Before this paper, we only knew of a few isolated examples. Now, we have a "blueprint" (a formula) that can generate an endless supply of them.

Here is how he did it, using simple analogies:

1. The "Regular" Shortcut

Building these bridges is like trying to solve a massive, tangled knot. To make it easier, the author uses a "regularity" rule. Think of this as a special alignment of the pillars. If the pillars are aligned in a specific, symmetrical way, the math simplifies dramatically.

Without the rule: You are trying to solve a 4D puzzle.
With the rule: The puzzle collapses into a 2D shape (an elliptic curve), which mathematicians know how to navigate.

2. The "Magic Formula" (Parametric Families)

The author found three different "magic formulas." You can plug in any number (like a dial on a machine) into these formulas, and they spit out three new numbers that form a valid bridge.

Family 1: By tweaking a variable, he proved you can make bridges where all three numbers are positive. This is a big deal because earlier formulas often forced one number to be negative (like having a pillar made of "anti-matter").
Family 2 & 3: He found other ways to generate these sets, some based on ancient number patterns called "Pell equations" (which are like a game of musical chairs for numbers).

The "Hard Mode" Levels: Sixth and Eighth Powers

After mastering the fourth power, the author tried to build bridges for even higher powers:

Sixth Power ( $n^6$ ): This is like asking for a bridge where the weight is a perfect cube of a square. He found a few specific examples by brute force (checking millions of numbers), but he couldn't find a "magic formula" to make infinite ones yet. It's like finding a few rare gems but not knowing how to mine them.
Eighth Power ( $n^8$ ): This is the "Boss Level." The math gets so complex that the "bridge" becomes a shape with too many holes (high genus) to easily navigate. He tried using famous formulas from history (Euler's), but they didn't work. Currently, we don't know if infinite eighth-power bridges even exist.

Why Does This Matter?

You might ask, "Who cares about multiplying numbers and adding 1?"

It's a Test of Limits: These problems are like the "Olympics of Math." They test the limits of our understanding of how numbers interact.
The "Infinite" Question: Proving that there are infinitely many solutions (rather than just a few lucky ones) changes our understanding of the structure of numbers. It shows that these patterns are not accidents; they are built into the fabric of mathematics.
The "Positive" Breakthrough: The author proved that you don't need negative numbers to make these work. You can build these structures entirely out of positive numbers, which is a more "natural" and satisfying result.

Summary Analogy

Imagine you are looking for a specific type of musical chord (three notes played together) where the harmony creates a perfect resonance.

Old Math: We knew a few chords that worked.
This Paper: The author discovered a new instrument and a sheet of music that allows you to play infinite perfect chords.
The Twist: He also tried to play chords with even more complex harmonies (6th and 8th powers). He found a couple of notes that work, but the sheet music for the rest is so complicated that we haven't figured out how to play it yet.

In short, Alen Andrašek has expanded our map of the mathematical universe, showing us that there are endless, beautiful patterns hidden in the simple act of multiplying numbers and adding one.

1. Problem Statement

The paper investigates Rational Diophantine $m$ -tuples, specifically focusing on the case where the product of any two distinct elements plus one is a perfect $k$ -th power (rather than just a square, which is the classical case).

Definition: A set of distinct nonzero rationals $\{a_1, \dots, a_m\}$ is a $k$ -th power Diophantine $m$ -tuple if $a_i a_j + 1 = t_{ij}^k$ for some rational $t_{ij}$ .
Focus: The primary focus is the quartic case ( $k=4$ ). The paper also briefly addresses the sextic ( $k=6$ ) and octic ( $k=8$ ) cases.
Goal: To construct infinite families of such triples, specifically proving the existence of infinitely many triples with positive elements for $k=4$ , and analyzing the difficulties in extending these methods to higher even powers.

2. Methodology

The author employs algebraic geometry and the theory of elliptic curves to construct solutions.

A. Regularity Condition

The core methodological innovation is the introduction of a "regular" condition for higher power triples, analogous to the classical definition for squares.

For a triple $\{a, b, c\}$ satisfying $ab+1=r^4$ , $ac+1=s^4$ , and $bc+1=t^4$ , the triple is regular if:
$a = s^2 - r^2$
(Equivalently, $c = a + b + 2r^2$ ).
Under this condition, the equation $bc+1=t^4$ reduces to a condition on $r$ and $s$ :
$\frac{s^2r^2 - 1}{s^2 - r^2} = t^2$
This transforms the problem into finding rational points on a surface that can be interpreted as an elliptic curve with a parameter.

B. Parametric Families via Elliptic Curves

The author derives three distinct infinite parametric families of regular quartic triples by imposing additional constraints on the parameters $r$ and $s$ :

Family 1 ( $a$ is a square):
- Assumes $a = s^2 - r^2 = \ell^2$ .
- This leads to an elliptic curve $y^2 = x^3 + 4(u^4-1)^2x$ .
- By finding points of infinite order on this curve, the author derives explicit rational formulas for $a, b, c$ in terms of a parameter $u$ .
Family 2 ( $s = \alpha r$ ):
- Assumes a linear relationship $s = \alpha r$ .
- This reduces the problem to the curve $y^2 = x^3 + 4\alpha^2(\alpha^2-1)^2x$ .
- Using the point $2P$ (where $P$ is a point of infinite order), the author constructs another family of triples.
Family 3 (Pell Equation Connection):
- The author searches for integer solutions where the rank of the associated elliptic curve is high.
- A connection is found with the Pell equation $p^2 - 3r^2 = 1$ .
- By parametrizing solutions to this Pell equation, the author generates a third family of triples. This family is particularly useful for generating triples with specific sign properties.

C. Generalization to Higher Powers ( $2k$ )

For general even powers $2k$ , the regularity condition leads to the system:
$x^k + y^k = z^k + 1$
$xyz = q^2$
This is equivalent to finding numbers expressible as a sum of two $k$ -th powers in two different ways (generalized taxicab numbers) such that the product of the bases is a square.

3. Key Results

A. Quartic Triples ( $k=4$ )

Infinite Families: The paper successfully constructs three non-trivial infinite parametric families of regular quartic Diophantine triples.
Positive Elements: The author proves Theorem 1: There are infinitely many quartic Diophantine triples where all elements are positive.
- Significance: Previous known parametrizations (e.g., by Batta et al.) always resulted in at least one negative element. This work resolves the existence of positive-only families for $k=4$ .
Integer Solutions: The paper notes that the only known integer quartic triple $\{1352, 9539880, 9768370\}$ is regular and corresponds to a specific point on the derived elliptic curve.

B. Sextic Triples ( $k=6$ )

Difficulty: The problem reduces to finding rational points on a genus 4 curve (or a hyperelliptic curve in specific sub-cases), which generally has only finitely many rational points.
Brute Force Findings: Despite the theoretical difficulty, the author found specific numerical examples of sextic triples via brute-force search, including identities like:
$243^3 + 1600^3 = 484^3 + 1587^3$
where the product of the bases is a square.
Non-Regularity: Many found sextic triples are not regular, suggesting that regularity is a very strong constraint for $k=6$ .

C. Octic Triples ( $k=8$ )

Impossibility of Current Methods: The problem reduces to solving $X^4 + Y^4 = Z^4 + W^4$ with $XYZW = \square$ .
Genus 2 Obstacle: Using Euler's parametric family for the sum of fourth powers, the condition that the product is a square leads to a genus 2 curve. By Faltings' Theorem, such curves have only finitely many rational points.
Conclusion: The author found no examples of regular octic triples and argues that the current method of using regularity is likely insufficient to generate infinite families for $k=8$ .

4. Significance and Contributions

Extension of Regularity: The paper successfully generalizes the concept of "regular" Diophantine triples from squares ( $k=2$ ) to quartics ( $k=4$ ), providing a robust algebraic framework for constructing solutions.
Resolution of Positivity: It settles the open question of whether infinitely many positive quartic Diophantine triples exist, proving they do.
Structural Insight: It highlights the transition in difficulty as $k$ increases. While $k=4$ yields elliptic curves (rank $\ge 1$ ), $k=6$ and $k=8$ lead to higher genus curves, making the existence of infinite families much harder to prove or disprove.
Computational Number Theory: The paper utilizes modern computational tools (PARI/GP, MAGMA) to verify ranks, find torsion points, and perform brute-force searches, bridging theoretical proofs with concrete examples.

5. Conclusion

The paper establishes that while regular quartic Diophantine triples are abundant and can be constructed to have all positive elements, the extension to higher even powers ( $k=6, 8$ ) encounters significant algebraic barriers (higher genus curves). The author concludes that while infinite families for $k=4$ are well-understood, the existence of infinite families for $k \ge 6$ remains an open and difficult problem, likely requiring methods beyond the "regularity" assumption.