Erdős Problem #386 — Binomial coefficients formed by consecutive primes
Let denote the th prime. The question is whether there are infinitely many ordered pairs of integers with for which there exist integers such that
Thus the factors must be a nonempty block of consecutive primes; both the starting prime and the length of the block may vary. For example, . Bloom, Erdős Problem #386
Background
Erdős and Graham posed this question in connection with the prime factors of binomial coefficients. Their discussion, cited at page 74 of Old and New Problems and Results in Combinatorial Number Theory, treats the case as especially difficult: they wrote that proving it occurs only finitely often seemed hopeless, while suggesting that it might never occur for . The symmetry means the range near either endpoint is reflected in the other. Bloom, Erdős Problem #386
In their 1976 work on the number of distinct prime divisors of binomial coefficients, Erdős, Gupta, and Khare likewise conjectured that, for , the binomial coefficient is a product of consecutive primes only for finitely many pairs . They explicitly noted that they could not prove even the corresponding finiteness assertion for . Erdős, Gupta, and Khare (1976)
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.