Erdős Problem #699 — Prime divisors common to two binomial coefficients
Let be integers with , and let denote the binomial coefficient. Is it always true that some prime satisfies
Equivalently, must the two binomial coefficients have a common prime divisor at least ? 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 , a prime dividing . 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)
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.