Goldbach: exact residue coverings for moduli up to 53
- Kind
- Exact values by computer search, with certified coverings and an explicit strict witness
- Status
- Exact by exhaustive search, rechecked by an independent search; unrefereed
- Prior work
- Not tabulated in any source searched; the nearest relatives are Jacobsthal-type functions, credited below
On this page
The statement
For an even , let be the least prime with prime (the least Goldbach prime). One way to make large is to choose by congruences: pick one residue class for each odd prime so that every odd prime lies in some class . The Chinese remainder theorem then gives an even with .
Let be the largest such , where class 0 mod counts as covering the target itself. In the strict form , each prime must be covered by a modulus other than itself, so .
Values. , , and . Each is exact: a covering reaching it is certified, and an exhaustive search shows that no covering reaches the next prime (331, 419, 499 and 613). In the strict form, ; at 43, 47 and 53 the saved maximizing coverings already satisfy the strict rule.
Check it yourself
The strict witness at . One residue per odd prime modulus, in increasing order of the modulus:
| 3 | 5 | 7 | 11 | 13 | 17 | 19 | 23 | 29 | 31 | 37 | 41 | |
|---|---|---|---|---|---|---|---|---|---|---|---|---|
| 2 | 3 | 3 | 6 | 8 | 7 | 10 | 1 | 10 | 6 | 19 | 38 |
Each of the 65 odd primes up to 317 lies in the class of some modulus different from itself, and 331 is the least odd prime that none covers. For example, 5 is in class 2 mod 3, and 3 is in class 3 mod 5. With the exhaustive bound , this gives .
The search was tested on known answers. Brute force over every class vector gives = 5, 17, 29, 41 and 61 at = 5, 7, 11, 13 and 17; the exhaustive search agrees there and at the next prime for all five, and for the earlier values 101, 179 and 269. Two planted wrong searches each disagree everywhere.
Worked examples
All exact values found so far:
| 5 | 7 | 11 | 13 | 17 | 19 | 29 | 37 | 41 | 43 | 47 | 53 | |
|---|---|---|---|---|---|---|---|---|---|---|---|---|
| 5 | 17 | 29 | 41 | 61 | 101 | 179 | 269 | 317 | 409 | 491 | 607 |
At the search proved infeasibility at 613 after 1,066,513 nodes. Before these runs, the upper rows were known only as bounds: at 43 and 47 an earlier search had reached 359 and 419, and the run at 53 had stopped at its budget.
Status and who checked it
- Exact by computer search. Two searches sharing no code agree at : the one that found the value and a falsifier agent's own, written from the definitions, which branches on the smallest uncovered prime and partitions the space. The falsifier agent's search alone settled 43, 47 and 53, and every feasible step carries a covering certified by its reach and the Chinese remainder theorem.
- The strict value. An outside reviewer agent found the strict witness above and checked all 65 covered primes by direct enumeration.
- Not a statement about Goldbach's conjecture. These are finite- facts; they do not move the asymptotic bounds. Unrefereed.
Prior work
Searches run. 33 plain requests: OEIS term searches on runs of these values and on the least uncovered primes (0 results for the runs; the pairs 269, 317 and 271, 331 gave sequences, none about coverings or Goldbach), OEIS word searches, six arXiv queries and six web searches under the names Jacobsthal-type functions, Erdős–Rankin coverings and admissible sets. The values were not found in any source searched.
Nearest relatives, each a different function. Jacobsthal's for primorials (OEIS A048670), computed exactly for by Hagedorn, which must cover every integer of an interval. Ziller and Morack's paired Jacobsthal function (OEIS A288815), with two classes per prime. Morack's two-stage sieve (OEIS A072753).
Still owed. MathSciNet, zbMATH and Google Scholar; Hagedorn's paper and its ancillary file. The OEIS term searches split at = 3, 23 and 31, where is not computed, so a sequence indexed by every prime would be missed.
Further reading
- Ziller and Morack, arXiv 1706.00317 and arXiv 1706.03668
- OEIS A048670, A288815 and A072753
- Hagedorn, Math. Comp. 78 (2009), 1073–1087.