← All problems

Erdős Problem #386 — Binomial coefficients formed by consecutive primes

46 years old · traced to

Let pjp_j denote the jjth prime. The question is whether there are infinitely many ordered pairs of integers (n,k)(n,k) with 2≤k≤n−22\leq k\leq n-2 for which there exist integers a,r≥1a,r\geq 1 such that

(nk)=∏j=0r−1pa+j.\binom{n}{k}=\prod_{j=0}^{r-1}p_{a+j}.

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, (212)=2⋅3⋅5⋅7\binom{21}{2}=2\cdot3\cdot5\cdot7. 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 k=2k=2 as especially difficult: they wrote that proving it occurs only finitely often seemed hopeless, while suggesting that it might never occur for 3≤k≤n−33\leq k\leq n-3. The symmetry (nk)=(nn−k)\binom{n}{k}=\binom{n}{n-k} 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 2≤k≤n/22\leq k\leq n/2, the binomial coefficient is a product of consecutive primes only for finitely many pairs (n,k)(n,k). They explicitly noted that they could not prove even the corresponding finiteness assertion for k=2k=2. Erdős, Gupta, and Khare (1976)

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.