A remark on Erdős Problem #962: k(n) < (11(n+1))^{2/5} from a 1987 construction

Let k(n) be the largest k for which some m ≤ n has each of m+1, …, m+k divisible by a prime > k. The Erdős Problems page #962 records the upper bound k(n) ≤ (1+o(1)) n1/2 and reports that Erdős could not prove k(n) ≤ n1/2−c for any constant c > 0. We point out that k(n) ≪ n2/5 follows from results of Friedlander and Lagarias (J. Number Theory 25 (1987), 249–273) on smooth numbers in short intervals, and we give a self-contained elementary proof with explicit constants: k(n) < (11(n+1))2/5 for every n ≥ 1. This is an observation about the literature, not a new method, and it does not address the main question whether log k(n) ≤ (log n)1/2+o(1). Notes: an observation about the literature, with an elementary proof; not formalized; not reviewed by independent human experts; the literature search for exponents below 2/5 was not exhaustive. Written with extensive use of generative AI tools under the author's direction. Code. The programs used for the numerical checks (computation of k(n) for all n ≤ 108; direct test of the construction in the Proposition) and their outputs are archived separately at doi:10.5281/zenodo.24190597.

Authors

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-11-13
DOI
https://doi.org/10.5281/zenodo.24188848
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 #962: k(n) < (11(n+1))^{2/5} from a 1987 construction

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

A remark on Erdős Problem #962: k(n) < (11(n+1))^{2/5} from a 1987 construction

Ryota Mori
preprint en

Abstract

Let k(n) be the largest k for which some m ≤ n has each of m+1, …, m+k divisible by a prime > k. The Erdős Problems page #962 records the upper bound k(n) ≤ (1+o(1)) n1/2 and reports that Erdős could not prove k(n) ≤ n1/2−c for any constant c > 0. We point out that k(n) ≪ n2/5 follows from results of Friedlander and Lagarias (J. Number Theory 25 (1987), 249–273) on smooth numbers in short intervals, and we give a self-contained elementary proof with explicit constants: k(n) < (11(n+1))2/5 for every n ≥ 1. This is an observation about the literature, not a new method, and it does not address the main question whether log k(n) ≤ (log n)1/2+o(1). Notes: an observation about the literature, with an elementary proof; not formalized; not reviewed by independent human experts; the literature search for exponents below 2/5 was not exhaustive. Written with extensive use of generative AI tools under the author's direction. Code. The programs used for the numerical checks (computation of k(n) for all n ≤ 108; direct test of the construction in the Proposition) and their outputs are archived separately at doi:10.5281/zenodo.24190597.

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