Balanced semiprimes in short intervals under the Riemann hypothesis

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

Contributed by Adam Henriksson ↗

Version 1 / Nov 21, 2026 / CC BY 4.0

Abstract

Assuming the Riemann hypothesis, we show that for every real x ≥ 9.6 × 10³⁷ the open interval of length 384√x (log x)² above x contains at least (14/3)√x distinct products of two primes of size comparable to √x. Their contribution to the sum of the least prime factor divided by the integer is at least 14/9. For every fixed C > 0, we also prove that the composite sum in an interval of length C√x (log x)² is bounded above unconditionally and bounded away from zero under the Riemann hypothesis. We present a computer-assisted proof, verified in Lean 4, that the mean-square estimate of Chirre and Hagen implies the explicit count and weight bounds. The results have not been independently reviewed.

Author comments: The proposed Lean statements and proof plan are available in the Tau Ceti roadmap. https://github.com/TauCetiProject/TauCetiRoadmap/commit/37a574a19ac4e127a147ab5a3ee4d456568a3f80

Tools used

OpenAI
ChatGPTVersion 6.2 Astra

References

  1. D. Bazzanella, A. Languasco and A. Zaccagnini, Prime numbers in logarithmic intervals (https://doi.org/10.1090/S0002-9947-09-05009-0), Trans. Amer. Math. Soc. 362 (2010), 2667--2684.DOI
  2. A. Chirre and M. V. Hagen, On Goldbach numbers in short intervals (https://doi.org/10.1007/s40993-026-00767-6), Res. Number Theory 12 (2026), article 82.DOI
  3. M. Cully-Hugill and A. W. Dudek, An explicit mean-value estimate for the prime number theorem in intervals (https://doi.org/10.1017/S1446788723000113), J. Aust. Math. Soc. 117 (2024), 1--15.DOI
  4. H. Cramér, Some theorems concerning prime numbers, Ark. Mat. Astron. Fys. 15 (1920), no. 5, 1--33.
  5. A. W. Dudek, On the Riemann hypothesis and the difference between primes (https://doi.org/10.1142/S1793042115500426), Int. J. Number Theory 11 (2015), 771--778.DOI
  6. P. Erdős and R. L. Graham, Old and New Problems and Results in Combinatorial Number Theory (https://mathweb.ucsd.edu/~ronspubs/80_11_number_theory.pdf#page=88), Monographies de L'Enseignement Mathématique, vol. 28, Geneva, 1980.link
  7. gpt-erdos project, Problem 462, candidate_solution.md (https://github.com/neelsomani/gpt-erdos/blob/7f6338357daa156aae565b6d8d43f8fe8532f07f/data/solutions/462/candidate_solution.md), revision 7f63383 .link
  8. S. Hubbard, https://github.com/sthubbar/lean-lab-preprints/blob/74c2d1ab2c2716ff50d5ace219ce45eab05adb51/LeanLab/ChirreHagen2025/ThetaPsi.lean LeanLab source for the comparison of θ\theta and ψ\psi , ThetaPsi.lean , revision 74c2d1a , 2026.link
  9. T. Tao, Comment on Erdős Problem 462 (https://www.erdosproblems.com/forum/thread/462), 28 September 2025.link
  10. R. Zeraoulia, Toward Erdős--Graham Problem 462 (composite-only): exact rough-number and semiprime decompositions, averaged progress, and quantitative necessary conditions (https://www.researchgate.net/publication/400404179_Toward_Erdos-Graham_Problem_462_composite-only_exact_rough-number_and_semiprime_decompositions_averaged_progress_and_uniformity_frameworks), preprint, 3 February 2026.link
Show all 12 referencesShow fewer references
  1. X. Zhang, On the sum of least prime factors in short intervals (https://arxiv.org/abs/2608.24930v2), arXiv:2608.24930v2, 2026.arXiv
  2. L. Grenié, G. Molteni and A. Perelli, Primes and prime ideals in short intervals (https://doi.org/10.1112/S0025579316000310), Mathematika 63 (2017), 364--371.DOI

Version history

  1. v1 · 6 pagesSubmitted by Adam HenrikssonThe proposed Lean statements and proof plan are available in the Tau Ceti roadmap. https://github.com/TauCetiProject/TauCetiRoadmap/commit/37a574a19ac4e127a147ab5a3ee4d456568a3f80CurrentNov 21, 2026