Elementary primorial bound

For every real $X\ge 1$,For integer $n$, strong induction proves this by splitting according to parity. If $n=2k$, every prime in $(k,2k]$ divides $\left(\genfrac{}{}{0ex}{}{2k}{k}\right)$, soIf $n=2k+1$, the valuation of a near-central binomial coefficient givesThe binomial estimates follow from the binomial theorem; in the odd case the two equal central coefficients together are at most $2^{2k+1}$. The result for real $X$ follows by replacing $X$ with $\lfloor X\rfloor$.