← All problems

Erdős Problem #699 — Prime divisors common to two binomial coefficients

1 year old · traced to

Let n,i,jn,i,j be integers with 1≤i<j≤n/21\le i<j\le n/2, and let (nk)\binom{n}{k} denote the binomial coefficient. Is it always true that some prime pp satisfies

p≥iandp∣gcd⁡ ⁣((ni),(nj))?p\ge i \qquad\text{and}\qquad p\mid\gcd\!\left(\binom{n}{i},\binom{n}{j}\right)?

Equivalently, must the two binomial coefficients have a common prime divisor at least ii? Erdős Problems #699

Background

This is a problem of Erdős and Szekeres from their 1978 paper on number-theoretic problems concerning binomial coefficients. The one-coefficient analogue is classical: the Sylvester–Schur theorem gives, for 1≤i≤n/21\le i\le n/2, a prime p>ip>i dividing (ni)\binom{n}{i}. The present question asks whether such a large prime can be found in common, not merely separately, for two binomial coefficients. Erdős Problems #699 Erdős and Szekeres (1978)

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.