Almost all primes up to n, in the logarithmic sense, divide the central binomial coefficient

For a positive integer n let f(n) be the sum of 1/p over the primes p ≤ n that do not divide the central binomial coefficient C(2n,n). Erdős, Graham, Ruzsa and Straus (Math. Comp. 29 (1975), 83–92) could not decide whether f(n) is bounded (Erdős Problem #377; Problem B33 in Guy's Unsolved Problems in Number Theory), and wrote that there is no doubt that f(n) = o(log log n). We prove f(n) ≤ 5 log log log n + O(1). In particular the sum of 1/p over the primes p ≤ n dividing C(2n,n) is log log n + O(log log log n). The proof combines Kummer's theorem, an upper bound sieve, and van der Corput's estimate for exponential sums, with the dependence on all parameters made explicit. It does not address the question whether f(n) is bounded. Version 2 strengthens the result of version 1, which proved f(n) = o(log log n). Notes: an unconditional result obtained by standard methods; the main question (boundedness of f(n)) remains open; not formalized; not reviewed by independent human experts; the statements of the cited textbook theorems were checked against search excerpts of the books and against restatements in the literature, not against the full printed texts; the literature search for earlier proofs of this statement was not exhaustive. Written with extensive use of generative AI tools under the author's direction. Code. The programs used for the numerical illustration and their outputs are archived separately at doi:10.5281/zenodo.24242366.

Authors

Publication Details

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

Almost all primes up to n, in the logarithmic sense, divide the central binomial coefficient

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

Almost all primes up to n, in the logarithmic sense, divide the central binomial coefficient

Ryota Mori
preprint en

Abstract

For a positive integer n let f(n) be the sum of 1/p over the primes p ≤ n that do not divide the central binomial coefficient C(2n,n). Erdős, Graham, Ruzsa and Straus (Math. Comp. 29 (1975), 83–92) could not decide whether f(n) is bounded (Erdős Problem #377; Problem B33 in Guy's Unsolved Problems in Number Theory), and wrote that there is no doubt that f(n) = o(log log n). We prove f(n) ≤ 5 log log log n + O(1). In particular the sum of 1/p over the primes p ≤ n dividing C(2n,n) is log log n + O(log log log n). The proof combines Kummer's theorem, an upper bound sieve, and van der Corput's estimate for exponential sums, with the dependence on all parameters made explicit. It does not address the question whether f(n) is bounded. Version 2 strengthens the result of version 1, which proved f(n) = o(log log n). Notes: an unconditional result obtained by standard methods; the main question (boundedness of f(n)) remains open; not formalized; not reviewed by independent human experts; the statements of the cited textbook theorems were checked against search excerpts of the books and against restatements in the literature, not against the full printed texts; the literature search for earlier proofs of this statement was not exhaustive. Written with extensive use of generative AI tools under the author's direction. Code. The programs used for the numerical illustration and their outputs are archived separately at doi:10.5281/zenodo.24242366.

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
Almost all primes up to n, in the logarithmic sense, divide the central binomial coefficient — Ryota Mori · Zenodo (CERN European Organization for Nuclear Research) (2026) | TGRS Research Map | TGRS