Erdős Problem #685 — Prime divisors of binomial coefficients
Fix , and let be a sufficiently large integer depending on . For every integer with , is it true, uniformly over these as with fixed, that
Here denotes the number of distinct prime divisors of the positive integer . The question also asks: “Or perhaps even when ?” Erdős Problem #685
Background
Erdős posed this question in connection with the prime divisors of binomial coefficients; the problem is cited to his 1979 paper, “Some unconventional problems in number theory.” The proposed main term focuses on primes strictly between and , rather than on the smaller primes that may also divide the coefficient. Erdős Problem #685 Erdős, Some unconventional problems in number theory (1979)
For a prime , the denominator contains no factor of , and the numerator of is the product of the consecutive integers from to . Since , this interval contains at most one multiple of . Thus divisibility by such a prime is tied to whether that short interval contains a multiple of ; the factor in the proposed main term reflects the corresponding heuristic frequency. This explains the shape of the conjectured sum but does not establish its asymptotic for a fixed . Erdős Problem #685 Shorey and Tijdeman, Prime Factors of Arithmetic Progressions and Binomial Coefficients
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.