← All problems

Erdős Problem #377 — Reciprocal sums of primes missing from central binomial coefficients

51 years old · traced to

For each positive integer nn, define

f(n)=∑p≤np prime1{p∤(2nn)}p,f(n)=\sum_{\substack{p\le n\\ p\text{ prime}}}\frac{1_{\{p\nmid\binom{2n}{n}\}}}{p},

where 1{p∤(2nn)}1_{\{p\nmid\binom{2n}{n}\}} is 11 if pp does not divide the central binomial coefficient and 00 otherwise. Is there an absolute constant C>0C>0 such that

f(n)≤Cf(n)\le C

for every positive integer nn? 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 nn, stays bounded uniformly as nn 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 pp and qq, infinitely many integers nn have (2nn)\binom{2n}{n} relatively prime to pqpq. 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 nn, which is the issue in the uniform-bound question. Erdős, Graham, Ruzsa, and Straus (1975)

References

Progress summary

Never refreshed

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.