A remark on Erdős Problem #462: the Riemann Hypothesis suffices

Let p(n) be the least prime factor of n. Erdős and Graham asked whether there is a constant C > 0 such that the sum of p(n)/n over the integers n in [x, x + C x1/2(log x)2] is ≫ 1 for all large x (Erdős Problem #462). Zhang (arXiv:2608.24930) studied the sum over composite n, with mean value 4C, and gave an affirmative answer under a hypothesis of Cramér type on primes in intervals of length at least a constant times (log y)2. We show that the Riemann Hypothesis is enough: under RH there are absolute constants C0 and c > 0 such that for every fixed C ≥ C0 and all large x the sum over composite n is at least cC. The proof counts products of two primes of size about x1/2 in the interval and uses the explicit formula in both variables. Notes: a conditional result (assuming the Riemann Hypothesis) obtained by standard methods; nothing is proved unconditionally, for small C, or about the conjectured asymptotic 4C; not formalized; not reviewed by independent human experts; the literature search for earlier statements of this result was not exhaustive. Written with extensive use of generative AI tools under the author's direction. Code. The program used for the numerical illustration and its output are archived separately at doi:10.5281/zenodo.24210939.

Authors

Publication Details

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

A remark on Erdős Problem #462: the Riemann Hypothesis suffices

Ryota Mori
Zenodo (CERN European Organization for Nuclear Research)
Analytic Number Theory Research
preprint

A remark on Erdős Problem #462: the Riemann Hypothesis suffices

Ryota Mori
preprint en

Abstract

Let p(n) be the least prime factor of n. Erdős and Graham asked whether there is a constant C > 0 such that the sum of p(n)/n over the integers n in [x, x + C x1/2(log x)2] is ≫ 1 for all large x (Erdős Problem #462). Zhang (arXiv:2608.24930) studied the sum over composite n, with mean value 4C, and gave an affirmative answer under a hypothesis of Cramér type on primes in intervals of length at least a constant times (log y)2. We show that the Riemann Hypothesis is enough: under RH there are absolute constants C0 and c > 0 such that for every fixed C ≥ C0 and all large x the sum over composite n is at least cC. The proof counts products of two primes of size about x1/2 in the interval and uses the explicit formula in both variables. Notes: a conditional result (assuming the Riemann Hypothesis) obtained by standard methods; nothing is proved unconditionally, for small C, or about the conjectured asymptotic 4C; not formalized; not reviewed by independent human experts; the literature search for earlier statements of this result was not exhaustive. Written with extensive use of generative AI tools under the author's direction. Code. The program used for the numerical illustration and its output are archived separately at doi:10.5281/zenodo.24210939.

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