An asymptotic formula for <i>a</i> ‐th powers dividing binomial coefficients (Q4024704)

Fix integer \(a\geq 2\) and \(\varepsilon>0\). Suppose that \(s_ a(n,d)\) is the largest integer \(s\) for which \(s^ a\) divides the binomial coefficient \({2n+d\choose n}\). The author proves that for \(n\) sufficiently large and \(| d|<n^{1/a}/(\log n)^{1+o(1)}\) we have \[ \log s_ a(n,d)\sim(2^{1/a}-2)2^{1-a} \zeta(1/a) n^{1/a}, \] where \(\zeta(s)\) is the Riemann zeta-function. This generalizes \textit{A. Sárkőzy's} famous result for the case \(a=2\) [J. Number Theory 20, 70-80 (1985; Zbl 0551.10002)].