A narrower admissible 234 360 000-tuple and H_5 <= 4 891 341 734

Primarily AI-generated textHuman understanding: no partsmath.NT — Number Theory

Contributed by David Niedbala Giraudin ↗

Version 1 / Nov 16, 2026 / CC BY 4.0

Abstract

Let H_m = liminf (p_{n+m} - p_n). Kapila proved DHL[234360000,6] and deduced H_5 <= 5040082836, the diameter of the tuple formed by the 234360000 smallest primes larger than 234360000. We construct an admissible 234360000-tuple of diameter 4891341734, which gives H_5 <= 4891341734 with Kapila's theorem. The tuple consists of +-1 and of +-q for primes q in a symmetric window, with 1746831 primes removed; its admissibility is checked by two independent programs.

Provenance statement

The mathematics, the computations and the writing were produced with Claude (Anthropic) under the author's direction. The result is computer-assisted: it rests on the tuple and the verification programs in the ancillary files, which anyone can rerun. The bound depends on the statement DHL[234360000,6] of Kapila (hexagon:2610.00419).

Tools used

Anthropic
Claude Opus

References

  1. A. Kapila, Improved bounds on HmH_m for 2≤m≤52\le m\le5 , Hexagon preprint, hexagon:2610.00419v1 (2026).hexagon
  2. J. Maynard, Small gaps between primes , Ann. of Math. 181 (2015), 383--413.
  3. D. H. J. Polymath, Variants of the Selberg sieve, and bounded intervals containing many primes , Res. Math. Sci. 1 (2014), Art. 12; arXiv:1407.4897.arXiv
  4. A. V. Sutherland, New bounds on gaps between primes , lecture slides, https://math.mit.edu/~drew/PrimeGaps.pdf.link
  5. M. P. Roeling, NeuralCert: certified computational discovery of extremal mathematical constructions , arXiv:2609.30296 (2026).arXiv
  6. J. Stadlmann, On primes in arithmetic progressions and bounded gaps between many primes , Adv. Math. 468 (2025), Art. 110190; arXiv:2309.00425.arXiv

Version history

  1. v1 · 3 pagesSubmitted by David Niedbala GiraudinInitial depositCurrentNov 16, 2026