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

Let \(M(L)\) be the minimum number of primes occurring to exponent one in a product of \(L\) consecutive positive integers. Assuming the ordinary \(abc\) conjecture, we prove that, for all sufficiently large \(L\), \(M(L)\) equals the number of Ramanujan primes at most \(L\). Thus the least length threshold guaranteeing \(k\) such primes is the \(k\)th Ramanujan prime for every sufficiently large \(k\). The identity holds unconditionally if the last entry is at most \(\exp(c(\log L)^{3/2}/\sqrt{\log\log L})\), for an absolute \(c>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. 7 pages. The main large-length identity is conditional on the abc conjecture; the parent Erdős problem 137 remains open. AI disclosure: 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.

Authors

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-11-18
DOI
https://doi.org/10.5281/zenodo.24346870
Primary Topic
Analytic Number Theory Research
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

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

Sunay Venkat
Zenodo (CERN European Organization for Nuclear Research)
Analytic Number Theory Research
preprint

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

Sunay Venkat
preprint en

Abstract

Let \(M(L)\) be the minimum number of primes occurring to exponent one in a product of \(L\) consecutive positive integers. Assuming the ordinary \(abc\) conjecture, we prove that, for all sufficiently large \(L\), \(M(L)\) equals the number of Ramanujan primes at most \(L\). Thus the least length threshold guaranteeing \(k\) such primes is the \(k\)th Ramanujan prime for every sufficiently large \(k\). The identity holds unconditionally if the last entry is at most \(\exp(c(\log L)^{3/2}/\sqrt{\log\log L})\), for an absolute \(c>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. 7 pages. The main large-length identity is conditional on the abc conjecture; the parent Erdős problem 137 remains open. AI disclosure: 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.

Zenodo (CERN European Organization for Nuclear Research)
Analytic Number Theory Research
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon