betaFeedback

WorksMathematics

On the Diophantine equation ab+bc+ca=Nab + bc + ca = N and Euler's idoneal numbers

Abstract

In this paper, it is proved that every natural number since 18491849 can be represented as ab+bc+caab+bc+ca with three distinct positive integers aa, bb and cc. A positive integer NN is an Euler's idoneal number if and only if it cannot be written as ab+bc+caab+bc+ca for distinct positive integers aa, bb and cc. Consequently, the number 18481848 is the largest Euler's idoneal number, which was conjectured by Euler in 1778 and Gauss in the Disquisitiones Arithmeticae.

Introduction

The Diophantine equation ab+bc+ca=Nab + bc + ca = N in three variables aa, bb and cc is a classic ternary quadratic form studied extensively. For instance, the number of solutions in positive integers aa, bb and cc of the equation, where NN is a given positive integer, was investigated by Mordell [28] in 1923. In this paper, we will prove the following solvability result.

Theorem 1 Every natural number N≥1849N \ge1849 can be represented as

N=ab+bc+ca(1)N = ab + bc + ca \tag*{(1)}

where aa, bb and cc are three distinct positive integers.

In other words, Theorem 1 tells that every even number 2N≥36982N \ge3698 is the surface area, i.e., the sum of areas of the six faces, of a right rectangular prism with three distinct edge lengths aa, bb and cc, which has the value of 2ab+2bc+2ca2ab + 2bc + 2ca.

The Diophantine equation ab+bc+ca=Nab + bc + ca = N in distinct positive integers aa, bb and cc for a given positive integer NN has the significance that its nonexistence of a solution is a characterization of a natural number NN to be an Euler’s idoneal number (see the survey paper by Kani [22 p. 125]). Idoneal numbers were discovered by Euler [11] around 1778 who used them to find large prime numbers. However, not every natural number is suitable for his method and hence Euler gave the name numeri idonei (i.e., suitable or convenient numbers) to those numbers that are suitable for testing the primality of large integers.

Euler listed the following 65 idoneal numbers:

11648120312
21857130330
32158133345
42260165357
52470168385
62572177408
72878190462
83085210520
93388232760
103793240840
12401022531320
13421052731365
15451122801848

Table 1.

Euler discovered that there are 65 idoneal numbers among all positive integers N≤10000N \le10000. Using the largest one 1848 in the list, Euler proved that 18518809=18480000+197218518809 = 18480000 + 197^2 is prime by showing that it has a single representation in the form 1848x2+y21848x^2 + y^2 (see Weil [47 p. 225]).

Idoneal numbers were later investigated by Gauss [14] in the Disquisitiones Arithmeticae. In the language of Gauss’s theory of quadratic forms, idoneal numbers correspond to discriminants where there is only one class of binary quadratic forms per genus. Gauss also identified the 65 idoneal numbers (see [14 Article 303]). Euler and Gauss conjectured that this list of 65 idoneal numbers is complete, i.e., that there would not be any more idoneal number for all N>10000N > 10000.

In 1973, Weinberger [48] showed that there are at most two other larger idoneal numbers if they exist, with help of a result due to D. H. Lehmer (see [48 p. 119]). It is obvious that if ab+bc+ca=Nab + bc + ca = N, then (2a)(2b)+(2b)(2c)+(2c)(2a)=4N(2a)(2b) + (2b)(2c) + (2c)(2a) = 4N. So, in case that 4N4N is one other larger idoneal number for some natural number NN, then NN is another. Therefore, there exist 65, 66, or 67 idoneal numbers.

By Theorem 1 and Euler’s list of 65 idoneal numbers, we obtain

Theorem 2 The number 1848 is the largest Euler’s idoneal number.

This theorem says that the list of 65 idoneal numbers is complete and hence the conjecture of Euler and Gauss is confirmed.

Outline of the proof of Theorem 1

In this paper, we will prove the following two propositions.

Proposition 1 Every squarefree positive integer N>1365N > 1365 with N≡1(mod4)N \equiv1 \pmod{4} can be represented as

N=ab+bc+ca(2)N = ab + bc + ca \tag*{(2)}

where aa, bb and cc are three distinct positive integers.

Proposition 2 Every squarefree positive integer N>462N > 462 with N≡2(mod4)N \equiv2 \pmod{4} can be represented as

N=ab+bc+ca(3)N = ab + bc + ca \tag*{(3)}

where aa, bb and cc are three distinct positive integers.

In the work of Grube [16] published in 1874, Euler’s results on idoneal numbers were analyzed and extended by employing Gauss’s theory of binary quadratic forms. There are other definition and criterion of an idoneal number that are not the same as but equivalent to Euler’s original definition (see Weil [47 Chapter III, Section §X]). Grube proved the following elementary criterion for Euler’s idoneal number (see also Frei [12 p. 57, Theorem 14] and Kani [22 p. 204, Proposition 17]).

Lemma 1 (Grube’s criterion) A natural number N≥3N \ge3 is an idoneal number if and only if for every b=1,⋯ ,⌊N/3⌋b = 1, \cdots, \lfloor\sqrt{N/3}\rfloor and every factorization

N+b2=acwith c≥a≥2b(4)N + b^2 = ac \quad\text{with } c \ge a \ge2b \tag*{(4)}

we have that either a=ca = c or a=2ba = 2b.

By putting b=xb = x, a=x+ya = x+y and c=x+zc = x+z in Grube’s criterion, we see that a natural number N≥3N \ge3 is an idoneal number if and only if the Diophantine equation

xy+yz+zx=Nxy + yz + zx = N

has no solution in distinct positive integers $0 < x < y < z$.

Based on Grube’s and Euler’s results as surveyed by Kani [22 Section 2.3], the classification of large idoneal numbers is readily available as follows (see [22 p. 203, Corollary 14]).

Proposition 3 If a natural number N>1848N > 1848 is an idoneal number, then N≢3(mod4)N \not\equiv3 \pmod{4}. Moreover, if N≡1,2(mod4)N \equiv1,2 \pmod{4}, then NN is squarefree, whereas if N≡0(mod4)N \equiv0 \pmod{4}, then M=N/4M = N/4 is a squarefree idoneal number with M≡2(mod4)M \equiv2 \pmod{4}.

For example, if N>1848N > 1848 and N=4L+3N = 4L + 3 for some positive integer LL, then NN can be expressed as N=xy+yz+zxN = xy + yz + zx with x=1x = 1, y=3y = 3, and z=L>3z = L > 3 and thus NN is not an idoneal number.

It follows easily from the above Propositions 1, 2 and 3 that every natural number N>1848N > 1848 cannot be an idoneal number and hence Theorem 1.

In the remainder of this paper, we are going to prove Propositions 1 and 2, which, together with the established classification result in Proposition 3, can imply Theorem 1.

An equivalent assertion of Propositions 1 and 2

In this section, we provide one assertion which is equivalent to Propositions 1 and 2 for every squarefree positive integer N>10000N > 10000, thanks to Euler’s result in the range N≤10000N \le10000 in which Propositions 1 and 2 are accordingly true.

Define r3(n)r_3(n) to be the number of representations of a nonnegative integer nn as a sum of three squares and let qq be a nonzero complex number with ∣q∣<1|q| < 1. Define the generating function

R3(q)=∑n=0∞r3(n)(−q)n=(∑m∈Z(−1)mqm2)3.R_3(q) = \sum_{n=0}^{\infty} r_3(n)(-q)^n = \left(\sum_{m\in\mathbb{Z}}(-1)^m q^{m^2}\right)^3.

In his work regarding mock theta functions of Ramanujan, Andrews found the following representation for R3(q)R_3(q) by using theory of qq-series (see [1 p. 124, Eqn. (5.16)])

∑n=0∞(−1)nr3(n)qn=1+4∑n=1∞(−1)nqn1+qn−2∑n=1∞∑∣j∣<n(−1)jqn2−j2(1−qn)1+qn.(5)\sum_{n=0}^{\infty}(-1)^n r_3(n)q^n = 1 + 4\sum_{n=1}^{\infty}\frac{(-1)^nq^n}{1+q^n} - 2\sum_{n=1}^{\infty}\sum_{|j|<n}\frac{(-1)^j q^{n^2-j^2}(1-q^n)}{1+q^n}. \tag*{(5)}

It can be readily deduced from Andrews’s identity (5) to obtain the following identity due to Crandall ([8 p. 376, Eqn. (6.2)]) that, for every positive integer N≥3N \ge3,

r3(N)=6(−1)N+1∑xy=N(−1)x+y+4(−1)N+1∑xy+yz+zx=N(−1)x+y+z(6)r_3(N) = 6(-1)^{N+1}\sum_{xy=N}(-1)^{x+y} + 4(-1)^{N+1}\sum_{xy+yz+zx=N}(-1)^{x+y+z} \tag*{(6)}

where every summation index integer xx, yy or zz is positive.

Based on the Andrews–Crandall identity in the form of (6), Mortenson proved the following two results (see [29 p. 777]).

Lemma 2 For every positive integer N≥5N \ge5 with N≡1(mod4)N \equiv1 \pmod{4}, we have

r3(N)=6∑d∣N1+12∑x≠yx2+2xy=N1+24∑x<y<zxy+yz+zx=N1(7)r_3(N) = 6\sum_{d\mid N}1 + 12\sum_{\substack{x\ne y \\ x^2+2xy=N}}1 + 24\sum_{\substack{x<y<z \\ xy+yz+zx=N}}1 \tag*{(7)}

where every summation index integer dd, xx, yy or zz is positive.

Lemma 3. For every positive integer N≥6N \ge6 with N≡2(mod4)N \equiv2 \pmod{4}, we have

r3(N)=12∑d∣(N/2)1+24∑x<y<zxy+yz+zx=N1(8)r_3(N) = 12 \sum_{d\mid(N/2)} 1 + 24 \sum_{\substack{x<y<z\\xy+yz+zx=N}} 1 \tag*{(8)}

where every summation index integer dd, xx, yy or zz is positive.

From Lemmas 2 and 3, we have the following two special results.

References

  1. [1]G. E. Andrews, The fifth and seventh order mock theta functions, Trans. Amer. Math. Soc., 293 no. 1 (1986), 113–134.DOI
  2. [2]T. M. Apostol, Introduction to Analytic Number Theory, New York, NY: Springer, 1976.
  3. [3]P. T. Bateman, On the representations of a number as the sum of three squares, Transactions of the American Mathematical Society, 71 no. 1 (1951), 70–101.DOI
  4. [4]C. Carathéodory Über den variabilitätsbereich der fourier’schen konstanten von positiven harmonischen funktionen, Rendiconti del Circolo Matematico di Palermo, 32 (1911), 193–217.DOI
  5. [5]H. Cohen, Number Theory Volume I: Tools and Diophantine Equations, Graduate Texts in Math. 239, New York, NY: Springer, 2007.
  6. [6]K. Conrad, Ostrowski’s theorem for number fields, Expository Papers, Online available: https://kconrad.math.uconn.edu/blurbs
  7. [7]J. B. Conrey and K. Soundararajan, Real zeros of quadratic Dirichlet L-functions, Invent. Math., 150 no. 1 (2002), 1–44.DOI
  8. [8]R. E. Crandall, New representations for the Madelung constant, Exp. Math., 8 (1999), 367–379.DOI
  9. [9]H. Davenport, Multiplicative Number Theory, 2nd Edition, Graduate Texts in Math. 74, New York, NY: Springer, 1980.DOI
  10. [10]A. S. Elsenhans, J. Klüners, and F. Nicolae, Imaginary quadratic number fields with class groups of small exponent, Acta Arith., 193 no. 3 (2020), 217–233.arxiv.org/abs/1803.02056
  11. [11]L. Euler, De formulis speciei mxx + nyy ad numeros primos explorandos idoneis earumque mirabilibus proprietatibus (Presented 16 March 1778), Nova acta acad. scien. Petropolitanae 12 (1794), 1801, 22–46 = Leonhardi Euleri Opera Omnia I, 4 (1916), 269–289.
  12. [12]G. Frei, Leonhard Euler’s convenient numbers, Math. Intell., 7 no. 3 (1985), 55–58, 64.DOI
  13. [13]J. B. Friedlander and H. Iwaniec, A note on Dirichlet L-functions, Expo. Math., 36 (2018), 343–350.
  14. [14]C. F. Gauss, Disquisitiones Arithmeticae, Translated by A. A. Clarke, 1966. New York, NY: Springer-Verlag, 1986.
  15. [15]E. Grosswald, Representations of Integers as Sums of Squares, New York, NY: Springer, 1985.DOI
  16. [16]F. Grube, Ueber einige Euler’sche Sätze aus der Theorie der quadratischen Formen, Zeitschrift Math. Physik, 19 (1874), 492–519.
  17. [17]G. H. Hardy and J. E. Littlewood, Some problems of “partitio numerorum” (V): A further contribution to the study of Goldbach’s problem, Proceedings of the London Mathematical Society, s2–22 (1924), 46–56.DOI
  18. [18]E. Hecke, in the paper by E. Landau, Über die Klassenzahl imaginärquadratischer Zahlkörper, Göttinger Nachrichten, 1918 (1918), 285–295.
  19. [19]J. Hoffstein, On the Siegel–Tatuzawa theorem, Acta Arith., 38 (1980), 167–174.DOI
  20. [20]T. W. Hungerford, Algebra, Graduate Texts in Math. 73, New York, NY: Springer, 1974.
  21. [22]E. Kani, Idoneal numbers and some generalizations, Ann. Sci. Math. Québec, 35 no. 2 (2011), 197–227.
  22. [23]H. W. Lenstra, Codes from algebraic number fields, in M. Hazewinkel, J. K. Lenstra, and L. G. L. T. Meertens (eds), Mathematics and Computer Science II, Fundamental Contributions in the Netherlands since 1945, CWI Monograph 4, Amsterdam, Netherlands: North-Holland, 1986, pp. 95–104.
  23. [24]X. B. Liang, The q-ary Gilbert–Varshamov bound can be improved for all but finitely many positive integers q, arXiv:2403.08727, March 2024.arxiv.org/abs/2403.08727
  24. [25]X. B. Liang, A recurrent neural network for nonlinear continuously differentiable optimization over a compact convex subset, IEEE Transactions on Neural Networks, 12 no. 6 (2001), 1487–1490.DOI
  25. [26]K. Mahler, On Hecke’s theorem on the real zeros of the L-functions and the class number of quadratic fields, Journal of the London Mathematical Society, 1–9 no. 4 (1934), 298–302.DOI
  26. [27]H. L. Montgomery and R. C. Vaughan, Multiplicative Number Theory I. Classical Theory, Cambridge Studies in Advanced Mathematics 97, Cambridge, U.K.: Cambridge University Press, 2006.
  27. [28]L. J. Mordell, On the number of solutions in positive integers of the equation yz + zx + xy = n, Amer. J. Math., 45 (1923), 1–4.DOI
  28. [29]E. T. Mortenson, A Kronecker-type identity and the representations of a number as a sum of three squares, Bull. London Math. Soc., 49 (2017), 770–783.
  29. [30]A. S. Mosunov and M. J. Jacobson, Unconditional class group tabulation of imaginary quadratic fields to |Δ| < 240, Mathematics of Computation, 85 (2016), 1983–2009.DOI
  30. [31]J. Neukirch, Algebraic Number Theory, Berlin, Germany: Springer, 1999.
  31. [32]OpenAI, Uniform exclusion of Landau–Siegel zeros, Manuscript, Oct. 1 (2026), 1–9.
  32. [33]A. Ostrowski, Über einige lösungen der funktionalgleichung φ(x) · φ(x) = φ(xy), Acta Math., 41 (1916), 271–284.
  33. [34]C. D. Pan and C. B. Pan, Fundamentals of Analytic Number Theory, Beijing: Science Press, 1991 (in Chinese).
  34. [35]H. Rademacher, On the Phragmén–Lindelöf theorem and some applications, Mathematische Zeitschrift, 72 (1959), 192–204.
  35. [36]J. B. Rosser, Explicit bounds for some functions of prime numbers, Amer. J. Math., 63 (1941), 211–232.DOI
  36. [37]J. B. Rosser and L. Schoenfeld, Approximate formulas for some functions of prime numbers, Illinois J. Math., 6 no. 1 (1962), 64–94.
  37. [38]J. Sherman and W. Morrison, Adjustment of an inverse matrix corresponding to a change in one element of a given matrix, Annals of Mathematical Statistics, 21 no. 1 (1950), 124–127.
  38. [39]C. L. Siegel, Über die Classenzahl quadratischer Zahlkörper, Acta Arith., 1 (1935), 83–86.
  39. [40]H. M. Stark, Some effective cases of the Brauer–Siegel theorem, Invent. Math., 23 (1974), 135–152.DOI
  40. [42]I. Stewart and D. Tall, Algebraic Number Theory and Fermat’s Last Theorem, 3rd Edition, Natick, MA: A. K. Peters, 2002.
  41. [43]T. Tatuzawa, On Siegel’s theorem, Japan. J. Math., 21 (1951), 163–178.
  42. [44]I. M. Vinogradov, Representation of an odd number as a sum of three primes, Dokl. Akad. Nauk SSSR, 15 (1937), 291–294.
  43. [45]A. Walfisz, Zur additiven Zahlentheorie. II., Mathematische Zeitschrift, 40 (1936), 592–607.DOI
  44. [46]M. Watkins, Real zeros of real odd Dirichlet L-functions, Math. Comp., 73 no. 245 (2004), 415–423.
  45. [47]A. Weil, Number Theory: An approach through history, Boston: Birkhäuser, 1964.
  46. [48]P. Weinberger, Exponents of the class groups of complex quadratic fields, Acta Arith., 22 (1973), 117–124.DOI
  47. [49]K. S. Williams, Integers of biquadratic fields, Canadian Mathematical Bulletin, 13 no. 4 (1970), 519–526.DOI

Paper details

vlnc:W_byc74s3b
Version
v1 · latest
Published
Fresh — published within the last 30 days
License
CC BY 4.0
Usage

views · 0

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Mathematics

Not recorded for this paper

View statement
Looking for related papers…
Contents