Erdős Problem #377 — Reciprocal sums of primes missing from central binomial coefficients
For each positive integer , define
where is if does not divide the central binomial coefficient and otherwise. Is there an absolute constant such that
for every positive integer ? Erdős Problems #377
Background
Erdős, Graham, Ruzsa, and Straus posed this question in their study of the prime factors of the central binomial coefficient. Their paper investigates quantitatively how often small primes divide that coefficient, while also considering how primes can be absent from its factorization. The present question asks whether the reciprocal weight of the absent primes, among primes up to , stays bounded uniformly as varies; this is stronger than merely controlling the number of such primes, since small primes carry greater weight. Erdős Problems #377 Erdős, Graham, Ruzsa, and Straus (1975)
The same paper proves that for any two fixed primes and , infinitely many integers have relatively prime to . This gives a related individual-prime perspective: divisibility by even a prescribed pair of primes can fail simultaneously infinitely often. It does not, however, control the total reciprocal weight over all primes up to , which is the issue in the uniform-bound question. Erdős, Graham, Ruzsa, and Straus (1975)
References
UnsolvedMath, Erdős Problems set, ULAM AI, licensed CC BY 4.0.
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.