CONSECUTIVE-PRIME PRODUCTS AMONG BINOMIAL COEFFICIENTS
Description
Let $p_1=2<p_2=3<\cdots$ denote the primes. We study solutions of
\[
\binom nk=\prod_{j=a}^{b}p_j,\qquad 2\leq k\leq n-2.
\]
Exact valuation criteria and prime-window arguments show that, apart from
finitely many exceptions, every solution with $k\leq n/2$ satisfies
$p_b\leq n/2$ and $(n-k,n]\cap\mathbb P=\varnothing$. Harmonic prime
windows give $p_b\ll n^{25/37}$. Combining short-interval prime estimates
with an exact allocation of the numerator factors yields, for every
$\varepsilon>0$,
\[
p_a,p_b\ll_\varepsilon(k\log n)^{25/12+\varepsilon},
\]
and uniformly
\[
\log p_b\ll(\log n)^{2/3}(\log\log n)^{1/3}.
\]
Consequently the support length $L=b-a+1$ satisfies the global lower bound
\[
L\gg k\left(\frac{\log n}{\log\log n}\right)^{1/3}
\]
for all sufficiently large solutions. We also obtain an explicit global
alternative controlling the lower support endpoint, sharper bounds for fixed
$k$, a classification of all solutions supported on at most three primes,
finiteness for fixed $k$ and fixed block length, and the counting estimate
\[
\#\{(n,k):n\leq X\}
\leq\exp\!\bigl(O((\log X)^{2/3}(\log\log X)^{1/3})\bigr).
\]
For the two initial branches of the case $k=2$, namely $p_b\#=n(n-1)$ and
$2\,p_b\#=n(n-1)$, we show that the admissible endpoints $p_b$ have density
zero among the primes, using an averaged Chebotarev density theorem of
Lemke Oliver and Smith, and that under the generalised Riemann hypothesis
there are $O(X^{1/2}(\log X)^4)$ of them up to $X$. We verify that these
branches have no further solutions with $p_b\leq10^{11}$, show that the two
equations are solvable for the same $p_b$ only when $p_b\in\{3,7\}$, and
solve the analogous problem over $\mathbb F_q[T]$ completely.
A pigeonhole argument shows that, at the uniform smoothness scale
displayed above, smooth coprime pairs attain the extremal spacing, so that
spacing estimates for generic smooth coprime pairs cannot decide the problem
uniformly in $k$; instead we isolate a linear-form hypothesis for $k=2$ and
a smooth-tuple hypothesis for $k\geq3$ that together imply finiteness.