On divisors of binomial coefficients. I (Q801094)

It is a well-known conjecture that for \(n>4\), the middle binomial coefficient \(\binom{2n}{n}\) is never squarefree. In this paper it is shown that this conjecture is true for all sufficiently large n. More precisely, let \(\binom{2n}{n}=s(n)^2 q(n)\) be the unique decomposition into a square \(s(n)^ 2\) and a squarefree integer q(n). The author shows that there exists a constant \(c>0\) such that \(\log s(n) \sim c\sqrt{n}\). His proof, based upon the method of trigonometric sums utilizes an exponential sum estimate due to M. Jutila.