← All problems

Erdős Problem #683 — Largest Prime Factor of a Binomial Coefficient

1 year old · traced to

For a positive integer m>1, let P(m) denote its largest prime factor. The question as stated asks whether there exists a real constant c>0 such that, for every pair of positive integers n,k with 0<k<n,

P ⁣((nk))>min⁡{n−k+1, k1+c}.P\!\left(\binom{n}{k}\right)>\min\{n-k+1,\ k^{1+c}\}.

Erdős Problems #683

With the strict inequality displayed above, the assertion is false for every c>0: taking n=4 and k=3 gives P(\binom{4}{3})=P(4)=2, whereas \min{2,3^{1+c}}=2. The Erdős problem page records the comparison with \geq rather than >, so that boundary distinction changes the answer. Erdős Problems #683

Background

The classical starting point is the Sylvester–Schur theorem: if n\geq 2k>0, then the largest prime factor of \binom{n}{k} exceeds k. This connects the question to prime factors of products of consecutive integers, since \binom{n}{k} is the product of n-k+1 through n divided by k!. Erdős’s work sought substantially stronger lower bounds than the linear bound supplied by Sylvester–Schur. Erdős Problems #683 Erdős (1985)

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.