A remark on Erdős Problem #962: k(n) < (11(n+1))^{2/5} from a 1987 construction
Year: 2026
Type: preprint
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.
Author: Mori, Ryota
Language: English
Subfield: Algebra and Number Theory
Field: Mathematics
Domain: Physical Sciences
Keywords: prime gaps, explicit constants, elementary proof
Open Access status: green
OpenAlex ID: W7226028141
