There are infinitely many rational Diophantine sextuples with square denominators
Andrej Dujella, Matija Kazalicki, Vinko Petri\v{c}evi\'c

TL;DR
This paper proves the existence of infinitely many rational Diophantine sextuples with all elements' denominators being perfect squares, extending the understanding of such sets in number theory.
Contribution
It establishes the existence of infinitely many rational Diophantine sextuples with square denominators, a new property not previously demonstrated.
Findings
Existence of infinitely many such sextuples proven.
All elements in these sextuples have square denominators.
Extends previous results on rational Diophantine sextuples.
Abstract
A rational Diophantine m-tuple is a set of m nonzero rationals such that the product of any two of them increased by 1 is a perfect square. The first rational Diophantine quadruple was found by Diophantus, while Euler proved that there are infinitely many rational Diophantine quintuples. In 1999, Gibbs found the first example of a rational Diophantine sextuple, and in 2016 Dujella, Kazalicki, Miki\'c and Szikszai proved that there are infinitely many of them. In this paper, we prove that there exist infinitely many rational Diophantine sextuples such that the denominators of all the elements in the sextuples are perfect squares.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
\marginsize
2.5cm2.5cm2.5cm2.5cm
There are infinitely many rational Diophantine sextuples with square denominators
Andrej Dujella
Department of Mathematics, University of Zagreb, Bijenička cesta 30, 10000 Zagreb, Croatia
,
Matija Kazalicki
Department of Mathematics, University of Zagreb, Bijenička cesta 30, 10000 Zagreb, Croatia
and
Vinko Petričević
Department of Mathematics, University of Zagreb, Bijenička cesta 30, 10000 Zagreb, Croatia
Abstract.
A rational Diophantine -tuple is a set of nonzero rationals such that the product of any two of them increased by is a perfect square. The first rational Diophantine quadruple was found by Diophantus, while Euler proved that there are infinitely many rational Diophantine quintuples. In 1999, Gibbs found the first example of a rational Diophantine sextuple, and in 2016 Dujella, Kazalicki, Mikić and Szikszai proved that there are infinitely many of them. In this paper, we prove that there exist infinitely many rational Diophantine sextuples such that the denominators of all the elements in the sextuples are perfect squares.
Key words and phrases:
Diophantine sextuples, elliptic curve
2010 Mathematics Subject Classification:
11D09, 11G05, 11Y50
The authors were supported by the QuantiXLie Centre of Excellence, a project co-financed by the Croatian Government and European Union through the European Regional Development Fund - the Competitiveness and Cohesion Operational Programme (Grant KK.01.1.1.01.0004), and by the Croatian Science Foundation under the project no. IP-2018-01-1313.
1. Introduction
A set of nonzero rationals is called a rational Diophantine -tuple if is a perfect square for all . The first example of a rational Diophantine quadruple was the set
[TABLE]
found by Diophantus (see [1]). Euler found infinitely many rational Diophantine quintuples (see [8]), e.g. he was able to extend the integer Diophantine quadruple
[TABLE]
found by Fermat, to the rational quintuple
[TABLE]
Stoll [10] recently showed that this extension is unique.
In 1999, Gibbs found the first example of rational Diophantine sextuple [6]
[TABLE]
and in 2016 Dujella, Kazalicki, Mikić and Szikszai [4] showed that there are infinitely many rational Diophantine triples that can be extended to the Diophantine sextuple in infinitely many ways. For example, there are infinitely many rational Diophantine sextuples containing the triples and . Soon after that, Dujella and Kazalicki [3] (inspired by the work of Piezas [9]) described another construction of rational Diophantine sextuples extending an infinite class of Diophantine quadruples to Diophantine sextuples in one way. For the description of this family see Section 2.
No example of a rational Diophantine septuple is known. On the other hand, as a consequence of the Lang conjecture on varieties of general type we expect the number of elements of a rational Diophantine tuple to be bounded (see Introduction of [4]). For more information on Diophantine -tuples see the survey article [2].
In this paper we study arithmetic properties of rational Diophantine sextuples, in particular we prove the following theorem.
Theorem 1**.**
There are infinitely many rational Diophantine sextuples such that denominators of all the elements (in the lowest terms) in the sextuples are perfect squares.
We can describe one such family in the following way. Let be a genus one curve defined over . It is birationally equivalent to the elliptic curve . Denote by the point of infinite order in Mordell-Weil group . For a positive integer denote by the -coordinate of the point on that corresponds to the point on under birational equivalence. Let be a family of Diophantine sextuples (for the construction of this family see Section 2)
[TABLE]
Proposition 1**.**
If is a positive integer such that , then is a rational Diophantine sextuple such that denominators of all the elements in the sextuple are perfect squares.
Remark 1*.*
Our construction always produced the sextuples with the mixed signs since the product of the first and the third element is a negative number.
2. Interpolating numerical data
Our starting point is an example of Diophantine sextuple with square denominators
[TABLE]
which we have discovered (together with seventeen other examples) by a numerical search which we now briefly describe.
In the first step of this experiment, we generated all Diophantine quintuples with numerators and denominators in the range between and . Next, we tried to extend each quintuple to a Diophantine sextuple by requiring that the sixth element forms a regular -tuple (where or ) with some elements from that quintuple. E.g. if is one such Diophantine quintuple, we can define such that holds (i.e. such that is a regular quadruple), and then check if is a Diophantine sextuple. Justification for this heuristics comes from the observation [5] that a “random” Diophantine sextuples often contains a regular Diohantine -tuple. For more information about regular -tuples see [7].
In order to describe a family of Diophantine sextuples containing , we recall the construction from [3].
Let be a rational Diophantine quadruple such that
[TABLE]
and let and be the roots of
[TABLE]
If then Proposition 1 in [3] (see also [9]) states that is a Diophantine sextuple.
Since the quadruple satisfies
[TABLE]
where are in or , it follows that defines a rational point on an algebraic variety defined by the following equations:
[TABLE]
Conversely, the points on determine two rational Diophantine quadruples (for example ) provided that the elements and are rational, distinct and non-zero. (Note that if one element is rational, then all the elements are rational.)
The projection defines a fibration of over the projective line, and a generic fiber is the product of three genus one curves , hence any point on corresponds to the three points , and on . The condition (1) is equivalent to , or . Hence, if we set , and , the condition (1) is automatically satisfied.
The curve over
[TABLE]
is birationally equivalent to the elliptic curve
[TABLE]
The map is given by , and , where .
Denote by a point of infinite order on , and by a point of order . The point corresponds to the point . The points and generate Mordell-Weil group (see [3]).
Therefore, to specify the family of Diophantine quadruples which satisfies (1) and whose product is , we need to specify two points and in ([3] gives sufficient conditions for three points and in to define the quadruple whose elements are rational, distinct and non-zero).
If we go back to our example, we can observe that the first four elements of satisfy condition , and that their product is equal to where . Inspired by the fact that is a square, we restrict to the subfamily , i.e. we consider the base change of to . If we further specialize and denote the resulting elliptic curve also by , then we obtain another point of infinite order in
[TABLE]
It is easy to check that the family corresponds to the triple , and we obtain if we specialize to , i.e. .
3. Analysis of the family
For a prime and , we denote by a -adic valuation of normalized such that . Let be an elliptic curve birationally equivalent to via the map , . Let be a generator of the free part of the Mordell-Weil group . For an integer , denote by .
Lemma 1**.**
Let be a positive integer. If then and . If then and .
Proof.
Define . Since , it follows that either or is a square mod . The first case occurs when (since is in the kernel of mod reduction map on ), and then implies that . In the second case one finds that (since the squares mod are and ). In the first case, since it follows , while in the second case . ∎
Proof of Proposition 1.
We analyze denominators of all the elements in separately.
- i)
Since , we have that . Similarly, , and . The claim follows from Lemma 1 since it implies that if . 2. ii)
We have that . The only primes that can divide denominator of are the primes that divide or . Assume that is a prime different than and . Since , if , then . Hence for such , if and [math] otherwise. If , then is even unless . Since the resultant of polynomials and is equal to (and is divisible only by and ) this can not happen. To rule out case, we note that since Lemma 1 implies that if . Hence . If , then and is even number. Finally, if , then which is not possible. 3. iii)
Since then . Let be a prime different than and . Same as in the part ii), if then if and [math] otherwise. If , then is even unless . Since the resultant of polynomials and is this can not happen. Note that (Lemma 1), hence if then . As earlier, is not possible, and if then and . 4. iv)
We have that
[TABLE]
Let be a prime different than and . If then . If , then is even unless
[TABLE]
As before, since the resultant is divisible only by and this can not happen. The resultant of polynomials and is , hence we have the same conclusion if . As earlier, is not possible. If , then , and we find that
[TABLE]
Similarly, if , then , and we have the same conclusion as above.
If , then since by the direct calculation we can show that . Similarly we can check that , , , and which implies that .
The claim for is proved in a similar way.
∎
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] Diophantus of Alexandria , Arithmetics and the Book of Polygonal Numbers, (I. G. Bashmakova, Ed.), Nauka, Moscow, 1974 (in Russian).
- 2[2] A. Dujella , What is…a Diophantine m 𝑚 m -tuple? , Notices of the AMS 63 , 7 (2016), 772–774.
- 3[3] A. Dujella, M. Kazalicki , More on Diophantine sextuples , In: Number Theory - Diophantine Problems, Uniform Distribution and Applications, Festschrift in honour of Robert F. Tichy’s 60th birthday (C. Elsholtz, P. Grabner, Eds.), Springer-Verlag, Berlin, pp. (2017), 227–235.
- 4[4] A. Dujella, M. Kazalicki, M. Mikić and M. Szikszai , There are infinitely many rational Diophantine sextuples , Int. Math. Res. Not. IMRN 2017 (2) (2017), 490-508.
- 5[5] P. Gibbs , A Survey of Rational Diophantine Sextuples of Low Height , preprint (2016)
- 6[6] P. Gibbs , Some rational Diophantine sextuples , Glas. Mat. Ser. III 41 (2006), 195–203.
- 7[7] P. Gibbs , Regular rational Diophantine sextuples , preprint (2016)
- 8[8] T. L. Heath , Diophantus of Alexandria. A Study in the History of Greek Algebra. Powell’s Bookstore, Chicago; Martino Publishing, Mansfield Center, 2003.
