Prime power divisors of \({2n \choose n}\) (Q1176399)

\textit{A. Sárközy} [J. Number Theory 20, 70--80 (1985; Zbl 0551.10002)] used \textit{M. Jutila}'s estimates on certain exponential sums [J. Indian Math. Soc., New. Ser. 38, 125--130 (1975; Zbl 0335.10045)], to show that \({2n \choose n}\) is not squarefree once \(n\) is sufficiently large. The author extends this result to prove that there exists a (computable) constant \(\gamma>0\) such that once \(n\) is sufficiently large then each binomial coefficient \({2n+d \choose n}\) with \(| d|<n^{1/2+\gamma}\), is divisible by the square of some prime \(p\) between \(\sqrt n\) and \(\sqrt{2n+| d|}\). He also shows that any given prime power \(p^ a\) (and thus any given integer \(d\)) divides `almost all' binomial coefficients \({2n \choose n}\).