← All problems

Erdős Problem #1095 — Binomial coefficients with large prime factors

55 years old · traced to

For each positive integer kk, define g(k)g(k) to be the least integer n>k+1n>k+1 for which every prime divisor of the binomial coefficient (nk)\binom{n}{k} is greater than kk:

g(k)=min⁡{n∈Z:n>k+1 and p>k for every prime p∣(nk)}.g(k)=\min\left\{n\in\mathbb Z:n>k+1\ \text{and}\ p>k\text{ for every prime }p\mid\binom{n}{k}\right\}.

The question is to estimate the growth of g(k)g(k) as kk 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 g(28)=284g(28)=284. The restriction n>k+1n>k+1 avoids the special case in which k+1k+1 is prime. They also conjectured that, for all sufficiently large kk, g(k)g(k) is smaller than Lk=lcm⁡(1,2,…,k)L_k=\operatorname{lcm}(1,2,\ldots,k), and proposed extreme fluctuations in consecutive values, expressed by lim sup⁡k→∞g(k+1)/g(k)=∞\limsup_{k\to\infty}g(k+1)/g(k)=\infty and lim inf⁡k→∞g(k+1)/g(k)=0\liminf_{k\to\infty}g(k+1)/g(k)=0. Ecklund, Erdős, and Selfridge (1974) Erdős Problems #1095

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.