Erdős Problem #1095 — Binomial coefficients with large prime factors
For each positive integer , define to be the least integer for which every prime divisor of the binomial coefficient is greater than :
The question is to estimate the growth of as varies. Ecklund, Erdős, and Selfridge (1974)
Background
Ecklund, Erdős, and Selfridge introduced this function in 1974 while studying the prime divisors of binomial coefficients. Their computations highlighted its irregular behavior: for example, they found . The restriction avoids the special case in which is prime. They also conjectured that, for all sufficiently large , is smaller than , and proposed extreme fluctuations in consecutive values, expressed by and . Ecklund, Erdős, and Selfridge (1974) Erdős Problems #1095
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.