Ramanujan primes and primes of exponent one in products of consecutive integers

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

Contributed by Sunay Venkat ↗

Version 1 / Nov 19, 2026 / CC BY 4.0

Abstract

Let M(L)M(L) be the minimum number of primes occurring to exponent one in a product of LL consecutive positive integers. Assuming the ordinary abcabc conjecture, we prove that, for all sufficiently large LL, M(L)M(L) equals the number of Ramanujan primes at most LL. Thus the least length threshold guaranteeing kk such primes is the kkth Ramanujan prime for every sufficiently large kk. The identity holds unconditionally if the last entry is at most exp⁡(c(log⁡L)3/2/log⁡log⁡L)\exp(c(\log L)^{3/2}/\sqrt{\log\log L}), for an absolute c>0c>0. We determine the limiting count at every fixed ratio of the starting offset to the length. We also prove unconditionally that the factorial count can exceed the minimum by an unbounded amount, and that ordinary primes contain arbitrarily long runs of consecutive non-Ramanujan primes.

Author comments: 7 pages. The main large-length identity is conditional on the abc conjecture; the parent Erdős problem 137 remains open.

Provenance statement

OpenAI's GPT-6.2 Astra carried out the mathematical research, developed the arguments and computations, and wrote this manuscript. Sunay Venkat, the author, takes full responsibility for its contents, including any errors.

References

  1. Conjectures.io, Erdős 137, multiple powerful factors variant (https://conjectures.io/problems/erdos137-erdos-137-variants-multiple-powerful-factors). Erdős Problems AI, problem 137 (https://erdosproblems.ai/wiki/problems/diophantine_problems/E0137).link
  2. W. van Doorn and Q. Tang, Consecutive integers free of certain prime factors (https://arxiv.org/abs/2606.19863), arXiv:2606.19863, 2026.arXiv
  3. P. Erdős, On consecutive integers (https://renyi.hu/~p_erdos/1955-04.pdf), Nieuw Arch. Wisk. (3) 3 (1955), 124--128.link
  4. P. Erdős, Miscellaneous problems in number theory (https://renyi.hu/~p_erdos/1982-08.pdf), Congr. Numer. 34 (1982), 25--45.link
  5. K. Ford, B. Green, S. Konyagin, J. Maynard and T. Tao, Long gaps between primes (https://arxiv.org/abs/1412.5029), J. Amer. Math. Soc. 31 (2018), 65--105.link
  6. A. Granville, On the scarcity of powerful binomial coefficients (https://doi.org/10.1112/S0025579300007853), Mathematika 46 (1999), 397--410.DOI
  7. L. Guth and J. Maynard, New large value estimates for Dirichlet polynomials (https://arxiv.org/abs/2405.20552), Ann. of Math. (2) 203 (2026).link
  8. D. R. Heath-Brown, https://doi.org/10.1112/plms/s3-64.2.265 Zero-free regions for Dirichlet LL-functions, and the least prime in an arithmetic progression , Proc. London Math. Soc. (3) 64 (1992), 265--338.DOI
  9. S. D. Hughes, Erdős problem 137, conditional reductions for powerful products of consecutive integers (https://github.com/scottdhughes/erdos137), public research repository.link
  10. S. V. Konyagin, Estimates of the least prime factor of a binomial coefficient (https://doi.org/10.1112/S0025579300007555), Mathematika 46 (1999), 41--55.DOI
Show all 15 referencesShow fewer references
  1. S. Laishram, On a conjecture on Ramanujan primes (https://doi.org/10.1142/S1793042110003848), Int. J. Number Theory 6 (2010), 1869--1873.DOI
  2. J. Maynard, Dense clusters of primes in subsets (https://arxiv.org/abs/1405.2593), Compos. Math. 152 (2016), 1517--1554.link
  3. J. Sondow, Ramanujan primes and Bertrand's postulate (https://arxiv.org/abs/0907.5232), Amer. Math. Monthly 116 (2009), 630--635.link
  4. J. Sondow, J. W. Nicholson and T. D. Noe, Ramanujan primes: bounds, runs, twins, and gaps (https://arxiv.org/abs/1105.2249), J. Integer Seq. 14 (2011), Art. 11.6.2.link
  5. T. Tao, Products of consecutive integers with unusual anatomy (https://arxiv.org/abs/2603.27990), arXiv:2603.27990, 2026.arXiv

Version history

  1. v1 · 7 pagesSubmitted by Sunay Venkat7 pages. The main large-length identity is conditional on the abc conjecture; the parent Erdős problem 137 remains open.CurrentNov 18, 2026