WorksMathematics
Euler's 1747 conjecture on sums of integers with restricted prime factors
Abstract
We prove that every positive integer congruent to modulo is a sum of two positive integers whose prime factors are all congruent to modulo , with admitted as a summand. Euler proposed this statement in a letter to Goldbach dated May 6, 1747. The proof counts representations by four squares and bounds those containing a common prime divisor congruent to modulo in either coordinate pair. An average over a nonsplit torus normalizer converts the quaternionic Hecke bound into an error independent of the sieving prime. Elementary estimates then give the explicit threshold . An exact finite arithmetic certificate covers the remaining integers in the required residue class.
Introduction
Let
The integer 1 belongs to . In his letter to Goldbach of May 6, 1747, Euler proposed that every integer of the form can be split into two integers of the form , each having no divisor of the form . This is the assertion proved here. The statement appears in Letter 115 of the collected correspondence, together with a discussion in editorial note 10 [4 pp. 935–936].
Dietmann and Elsholtz proved that every sufficiently large positive integer congruent to 2 modulo 4 has the required decomposition [2]. Their argument uses a result of Greaves on four squares with two prime variables. We obtain an explicit threshold by counting all four-square representations and estimating the unwanted common divisors of the two coordinate pairs.
Theorem 1.1. Every positive integer admits a decomposition
The quantitative part of the proof establishes the result for after removing factors from . § 7 gives an exact arithmetic certificate for the finite range below this threshold. The spectral ingredient is the weight-two Ramanujan–Petersson bound, applied through the Jacquet–Langlands correspondence. All auxiliary constants are explicit.
Four-square representations and prime obstructions
Write and . We first remove a multiplicative factor that already belongs to .
Lemma 2.1. To prove Theorem 1.1, it suffices to consider , where is odd and every prime divisor of belongs to .
Proof. For any odd , write , where and every prime divisor of belongs to . If with , then has the same property.
For the remainder of the analytic argument, satisfies Lemma 2.1. Put
These are signed, ordered representations. Jacobi’s four-square formula gives
Exactly two coordinates are odd, since a square is 0 or 1 modulo 4. Let consist of the representations in which each of and has opposite parity. Permuting coordinates shows that the six possible placements of the odd coordinates occur equally often. Four of them have the required parity, so
For , let count the elements of for which
Since is a quadratic nonresidue modulo , the implication holds. Consequently, any representation outside all these exceptional sets supplies two positive odd summands in . It is therefore enough to prove
A uniform quaternionic estimate
Proposition 3.1. For every ,
The estimate follows from a Hecke action on a finite quotient associated with the Hurwitz order.
The Hurwitz order and its finite quotient
Let be the Hamilton quaternion algebra, where and . Its reduced norm is
The Hurwitz order is
with coordinates interpreted in the basis . Its 24 units are the eight coordinate units and the sixteen elements .
The order is norm-Euclidean. Indeed, rounding four real coordinates to integers gives a remainder of norm at most 1. Equality requires all four coordinates to be half-integers, in which case a Hurwitz half-integer gives remainder zero. Euclidean division implies that every right ideal is principal. In particular, the right ideal class number of is one.
Let . Right multiplication by is a bijection
For the inverse, divide an integral quaternion of norm by . The new coordinates are halves of the sums and differences in two coordinate pairs. The two odd coordinates of the original quaternion ensure that all four new coordinates are integers or all four are strict half-integers. Thus the inverse belongs to .
Fix with . The algebra splits at every odd prime, and reduction identifies with , with reduced norm corresponding to determinant. Write
Let and . The only units with scalar reduction are , so
We equip with the counting inner product.
The Hecke operator and its spectral bound
For odd and , define
Right multiplication by a unit permutes the left-unit classes in , so this is well-defined. It commutes with right translation by . Quaternion conjugation permutes and gives projective inversion, which proves self-adjointness. Equations (1) and (5) give .
The function
is well-defined because a scalar changes the determinant by a square and every element of has square determinant. It satisfies .
Lemma 3.2. On , the operator norm of is at most .
Proof. Let denote the algebraic group of projective units of . At a finite prime , take the projective image of as the local level. At , take the kernel of reduction from to . Denote the product of these compact open subgroups by . The class-number-one property gives
To see the stabilizer, choose an integral representative at every finite place. A rational quaternion carrying one such representative to another can, after rational rescaling, be taken to be a Hurwitz unit. Its remaining action at is precisely .
The usual unramified Hecke correspondence of index on (8) is (7). In fact, its local right cosets at specify integral right ideals of reduced norm . Combining these local ideals gives the integral right ideals of reduced norm . Each is for an , unique up to right multiplication by a unit. Returning to integral representatives gives at . Conjugation sends these right-unit classes to the left-unit classes in (7), since projectively .
One-dimensional automorphic representations factor through the reduced norm. Their restrictions to depend only on the determinant in , so lie in the span of and . The Jacquet–Langlands correspondence transfers the remaining representations to weight-two cuspidal representations, unramified at every prime dividing [5 §16]. This use of the correspondence and the weight-two spectral bound is also described in [3 §8.4].
By Ramanujan–Petersson, at an unramified prime the normalized Satake parameters have absolute value [1]. In the normalization of (7), the index- eigenvalue is
The triangular cosets with diagonal have multiplicity and spherical factor . Their product is , giving the displayed normalization. The eigenvalue is at most in absolute value. Multiplication over proves the lemma. ∎
Averaging over a torus normalizer
Since , the subalgebra is the field . Let
Conjugation by induces the nontrivial field automorphism, so is a subgroup of order . An invertible quaternion has its first or its second coordinate pair zero modulo exactly when its projective reduction belongs to . Since , multiplication by preserves this condition.
The intersection consists of the four projective classes of . Let
There are points in . Each left-unit class whose reduction lies in has exactly eight elements reducing into . Counting all representations therefore gives
The function is invariant under right translation by . The same is true of , hence
The norm map is surjective. The orbit therefore has equally many points in the two determinant classes. Thus is orthogonal to both and , and
Lemma 3.2 and (10) imply
For one has , so the second term vanishes. Combining (9) and (11) with proves Proposition 3.1 when .
Completion of the proof of Proposition 3.1. Suppose . If a coordinate pair is divisible by , the other pair has sum of squares zero modulo , so all four coordinates are divisible by . Hence when and otherwise. Writing gives
It follows that . □
Large primes and elementary lattice counting
For , let be the number of signed, ordered pairs with opposite parity and .
Lemma 4.1. For every , one has .
Proof. Each orbit under quarter-turns has four elements and a unique representative with and . Write
Assign to this pair the positive integer . For fixed , these labels run from to . The labels are therefore distinct. Moreover,
At most labels can occur. Multiplication by four gives the claimed upper bound. □
Define
The two-square formula implies for , where counts signed, ordered representations.
Lemma 4.2. For every ,
Proof. If divides the first coordinate pair, divide that pair by . Lemma 4.1 leaves at most possibilities. The other pair has positive norm, because its coordinates have opposite parity, and has at most representations. Accounting for either pair gives
Such a prime is at most , since the pair it divides is nonzero. Sum this estimate and use . □
Explicit arithmetic estimates
Lemma 5.1. Under the hypotheses of Lemma 2.1,
Proof. For , , one has
For the second bound, the corresponding local factor is . At a prime at least , both factors are at most , since .
For smaller primes, the ratio of successive values of is , which decreases with . The maximizing positive exponent is therefore determined by . The required values are
| , | 3 | 7 | 11 | 19 | 23 | 31 |
| Maximizing positive | 4 | 2 | 1 | 1 | 1 | 1 |
| , | 5 | 13 | 17 | 29 | ||
| Maximizing positive | 2 | 1 | 1 | 1 |
Taking the maximum with allows each prime to be absent. The products of the fifth powers of the resulting local bounds are
Multiplication over the prime factors proves both assertions. □
Lemma 5.2. The following bounds hold for real and .
Proof. Every prime in exceeding 3 belongs to one of the eight residue classes
Let count the positive integers at most in these classes. Checking the eight jumps in one period gives
Periodicity extends the bound to every , and proves (14). For it also gives
Partial summation yields
For , this set contains all the primes in (15). Finally, direct summation through 60 gives
Here for , so (15) bounds the remainder. □
The analytic range
Proposition 6.1. Suppose , where is odd and all its prime divisors belong to . Then .
Proof. Set and . Proposition 3.1, Lemma 5.1, and (14) give
For the large primes, Lemmas 4.2–5.2 give
The prime-count term in (12) was bounded by .
For ,
The first two inequalities follow by raising to the fifth and tenth powers. Adding (17) and (18) now gives
Equations (2) and (3) therefore supply the required representation. □
The finite range
We give the finite arithmetic certificate in terms of binary indicators and finite sets. Put and define
Each factor is if and is otherwise. Thus .
Lemma 7.1. For , one has exactly when .
Proof. The integer is odd and congruent to modulo . Its prime factors belonging to occur an even number of times, counting multiplicity. If any occur, at least two occur. At least one of these factors is then no larger than . Formula (19) detects precisely this possibility. □
Let . The corresponding possible summands are
For , , define the exact integer
It counts the indices still unrepresented when the first summand is at most . Table 1 records successive values of (20); all quantities are integers.
The evaluation in the table can equivalently be performed by the following finite-set recurrence, which specifies every removal. Start with . In increasing order, for each replace the current set by
The indicators themselves are obtained by starting with all indices retained and, for each of the 287 primes in , removing the progression
| 1 | 2 849 643 | 101 | 6 561 | 229 | 8 |
| 13 | 1 261 334 | 149 | 756 | 277 | 2 |
| 29 | 364 708 | 193 | 57 | 289 | 1 |
| 61 | 71 867 | 205 | 23 | 313 | 0 |
Table 1. The finite arithmetic certificate. Each column pair gives an upper bound for the first summand and the number of indices remaining.
There are 1,344,661 retained indices. The recurrence (21) ends with the empty set, as recorded by .
Proposition 7.2. For every with , there are such that . The smaller summand can be chosen at most 313.
Proof. Write , where . Since , one of the factors in the th product in (20) vanishes. Thus for some with . Lemma 7.1 gives
One of these summands is at most 313. □
Proof of Theorem 1.1. Use Lemma 2.1 to write with and every prime divisor of in . Proposition 6.1 applies if . Proposition 7.2 applies otherwise. In both cases, multiply the resulting two summands by . □
Acknowledgment
OpenAI Codex generated the mathematical argument, performed the exact calculations, and drafted the manuscript under human direction.
References
Email address: [email protected]
Email address: [email protected]
Email address: [email protected]
Email address: [email protected]
References
- [1]P. Deligne, La conjecture de Weil. I, Publ. Math. Inst. Hautes Études Sci. 43 (1974), 273–307. doi:10.1007/BF02684373.DOI
- [2]R. Dietmann and C. Elsholtz, Sums of two numbers having only prime factors congruent to one modulo four, in Number Theory Week 2017, Banach Center Publications 118 (2019), 177–179. doi:10.4064/bc118-11.DOI
- [3]J. S. Ellenberg, P. Michel, and A. Venkatesh, Linnik’s ergodic method and the distribution of integer points on spheres, in Automorphic Representations and L-Functions, Tata Institute of Fundamental Research Studies in Mathematics 22 (2013), 119–185. Author manuscript (§8.4).
- [4]L. Euler, Letter to Christian Goldbach, May 6, 1747, Letter 115, in F. Lemmermeyer and M. Mattmüller (eds.), Correspondence of Leonhard Euler with Christian Goldbach, Opera Omnia, Series IVA, vol. 4, online edition, Bernoulli–Euler-Gesellschaft, Basel, 2016, 935–936. doi:10.12685/pubblbez.1.2016.
- [5]H. Jacquet and R. P. Langlands, Automorphic Forms on GL(2), Lecture Notes in Mathematics 114, Springer, Berlin, 1970, §16. doi:10.1007/BFb0058988.