The Differences Between Consecutive Primes. V
Pith reviewed 2026-05-25 18:12 UTC · model grok-4.3
The pith
The total length of prime gaps at least as large as the square root of the prime is at most on the order of x to the 3/5 power.
A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.
Core claim
We show that the sum over p_n ≤ x with p_{n+1} - p_n ≥ √p_n of (p_{n+1} - p_n) is ≪_ε x^{3/5 + ε} for any fixed ε > 0. This improves a result of Matomäki in which the exponent was 2/3.
What carries the argument
The sum of the lengths of large consecutive prime gaps, bounded using analytic techniques.
If this is right
- The bound holds with an arbitrarily small epsilon in the exponent.
- The result applies the improved analytic methods to this specific sum of gaps.
- It provides a stricter limit than x to the 2/3 on the contribution of these large gaps.
- Such sums can be controlled without additional restrictions from the method.
Where Pith is reading between the lines
- If the bound is sharp, it suggests that large gaps do not dominate the prime counting function in this range.
- Similar techniques might apply to sums with different gap thresholds, such as log p_n or p_n^θ for other θ.
- Connections to the distribution of primes in short intervals could be explored using this bound.
Load-bearing premise
The analytic techniques that improve Matomäki's exponent are assumed to apply directly to this particular sum without error terms or restrictions that would prevent reaching the 3/5+ε bound.
What would settle it
A numerical computation of the sum for successively larger values of x that shows the sum growing faster than x^{3/5 + 0.01} for some range of x would falsify the claim.
read the original abstract
We show that \[\sum_{\substack{p_n\le x\\ p_{n+1}-p_n\ge\sqrt{p_n}}}(p_{n+1}-p_n)\ll_{\varepsilon} x^{3/5+\varepsilon}\] for any fixed $\varepsilon>0$. This improves a result of Matom\"{a}ki, in which the exponent was $2/3$.
Editorial analysis
A structured set of objections, weighed in public.
Referee Report
Summary. The paper proves that ∑_{p_n ≤ x, p_{n+1}-p_n ≥ √p_n} (p_{n+1}-p_n) ≪_ε x^{3/5+ε} for any fixed ε>0, improving Matomäki's exponent of 2/3 on the summed contribution of large prime gaps.
Significance. If the result holds, it strengthens the quantitative control on the total mass of gaps exceeding √p_n, obtained by adapting Matomäki's analytic methods with optimized truncation and level-of-distribution parameters while tracking error terms explicitly. The improvement is modest but unconditional and directly comparable to the cited predecessor.
minor comments (2)
- The abstract and introduction should explicitly recall the precise statement of Matomäki's theorem being improved (including the range of summation) for immediate comparison.
- Notation for the von Mangoldt function and the level of distribution in the Bombieri–Vinogradov input could be standardized with the cited reference to avoid minor ambiguity in §3.
Simulated Author's Rebuttal
We thank the referee for their positive assessment of the manuscript and their recommendation to accept.
Circularity Check
No significant circularity; derivation adapts external methods independently
full rationale
The paper improves Matomäki's external 2/3 exponent to 3/5+ε by adapting analytic techniques (level of distribution, truncation parameters) with explicitly tracked error terms that remain admissible. No load-bearing step reduces by definition, by fitted-input renaming, or by self-citation chain; the cited Matomäki result is independent prior work by a different author. The derivation is self-contained against external benchmarks and does not invoke uniqueness theorems or ansatzes from the present authors' prior papers.
Axiom & Free-Parameter Ledger
axioms (1)
- domain assumption Standard results and techniques from analytic number theory on prime distributions apply to this weighted sum of gaps.
Forward citations
Cited by 1 Pith paper
-
Critical probabilistic characteristics of the Cram\'er model for primes and arithmetical properties
Proves a density-1 set where (log n) times the probability that a Cramér model sum S_n is prime is bounded below by 1/sqrt(2 pi e), an asymptotic Gaussian integral formula involving the prime counting function pi(t), ...
Reference graph
Works this paper leans on
- [1]
-
[2]
Heath-Brown, The differences between consecutive primes , J
D.R. Heath-Brown, The differences between consecutive primes , J. Lon- don Math. Soc. , 18 (1978), 7–13
work page 1978
-
[3]
Heath-Brown, The differences between consecutive primes , III, J
D.R. Heath-Brown, The differences between consecutive primes , III, J. London Math. Soc. 20, (1979), 177–178
work page 1979
-
[4]
Heath-Brown, Prime numbers in short intervals and a genera lized Vaughan identity, Can
D.R. Heath-Brown, Prime numbers in short intervals and a genera lized Vaughan identity, Can. J. Math. , 34 (1982), 1365–1377
work page 1982
-
[5]
Heath-Brown, The number of primes in a short interval, J
D.R. Heath-Brown, The number of primes in a short interval, J. Reine angew. Math. , 389 (1988), 22–63
work page 1988
-
[6]
D.R. Heath-Brown, The differences between consecutive primes , IV, A tribute to Paul Erd˝ os, (Cambridge University Press, 1990), 277–287
work page 1990
-
[7]
D.R. Heath-Brown, The differences between consecutive smoot h num- bers, Acta Arithmetica, 184 (2018), 267-285
work page 2018
-
[8]
Huxley, On the difference between consecutive primes, Invent
M.N. Huxley, On the difference between consecutive primes, Invent. Math., 15 (1972), 164–170
work page 1972
-
[9]
Jutila, Zero density estimates for L-functions, Acta Arith., 32 (1977), 55–62
M. Jutila, Zero density estimates for L-functions, Acta Arith., 32 (1977), 55–62
work page 1977
-
[10]
Matom¨ aki, Large differences between consecutive primes
K. Matom¨ aki, Large differences between consecutive primes. Q. J. Math. 58 (2007), 489–518
work page 2007
-
[11]
Montgomery, Topics in multiplicative number theory, Lecture Notes in Math
H.L. Montgomery, Topics in multiplicative number theory, Lecture Notes in Math. 227, (Springer, Berlin-Heidelberg- New York), 1971
work page 1971
-
[12]
Peck, Differences between consecutive primes, Proc
A.S. Peck, Differences between consecutive primes, Proc. London Math. Soc., 76 (1998), 33–69
work page 1998
-
[13]
A. Selberg, On the normal density of primes in small intervals and the difference between consecutive primes, Arch. Math. Naturvid. , t. 47, (1943), no. 6, 87–105
work page 1943
-
[14]
Shiu, A Brun–Titchmarsh theorem for multiplicative functions , J
P. Shiu, A Brun–Titchmarsh theorem for multiplicative functions , J. Reine angew. Math. , 313 (1980), 161–170. 45
work page 1980
-
[15]
Titchmarsh, The theory of the Riemann zeta-function
E.C. Titchmarsh, The theory of the Riemann zeta-function . Second edi- tion. (Oxford University Press, New York, 1986)
work page 1986
-
[16]
Wolke, Grosse Differenzen aufeinanderfolgender Primzahlen , Math
D. Wolke, Grosse Differenzen aufeinanderfolgender Primzahlen , Math. Ann., 218 (1975), 269–271
work page 1975
-
[17]
Yu, The differences between consecutive primes, Bull
G. Yu, The differences between consecutive primes, Bull. London Math. Soc. 28 (1996), 242–248. Mathematical Institute, Radcliffe Observatory Quarter, Woodstock Road, Oxford OX2 6GG UK rhb@maths.ox.ac.uk 46
work page 1996
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.