# Divisibility of a binomial coefficient by $p^2$ — current status

While skimming the book Concrete Mathematics, (edit: first edition) I came across the following problem, which is listed there as a Research Problem: (Chapter 5, Exercise 96)

Is ${2n \choose n}$ divisible by the square of a prime for all $n > 4$.

This problem looked to me much simpler than a divisibility problem that I found on MO (look here), but then again, I guess in number theory, the simpler the problems looks, the harder it usually is!

The nice form of this problem has made me very curious to find out more about it. But because I do not have more than a fleeting acquaintance with number theory, I don't know what search keywords would be useful to gain more information about this problem.

• In the second edition of Concrete Math, this seems to be Exercise 112, and it reads "Is $2n\choose n$ divisible either by 4 or 9, for all $n>4$ except for $n=64$ and $n=256$?" – Sidney Raffer Nov 13 '10 at 15:44
• Yes, it was proved in 1980 by S´ark¨ozy, A. (On divisors of binomial coefficients. I. J. Number Theory 20 (1985), no. 1, 70–80.) that this conjecture holds for sufficiently large values of $n$, and by A. Granville and O. Ramar´e (Explicit bounds on exponential sums and the scarcity of squarefree binomial coefficients. Mathematika 43 (1996), no. 1, 73–107.) for all $n>4$. – Fedor Petrov Nov 13 '10 at 15:50