Editing Square-free integer (section)

==Erdős squarefree conjecture==
The [[central binomial coefficient]]

: <math>{2n \choose n}</math>

is never squarefree for ''n'' > 4. This was proven in 1985 for all sufficiently large integers by [[András Sárközy]],<ref>{{cite journal
 | last = Sárközy | first = A. | author-link = András Sárközy
 | doi = 10.1016/0022-314X(85)90017-4 | doi-access=free
 | issue = 1
 | journal = Journal of Number Theory
 | mr = 777971
 | pages = 70–80
 | title = On divisors of binomial coefficients. I
 | volume = 20
 | year = 1985}}</ref> and for all integers > 4 in 1996 by [[Olivier Ramaré]] and [[Andrew Granville]].<ref>{{cite journal
| last1=Ramaré | first1=Olivier | last2=Granville | first2=Andrew
| title=Explicit bounds on exponential sums and the scarcity of squarefree binomial coefficients
| journal=[[Mathematika]]
| volume=43
| date=1996
| issue=1
| pages=73–107
| doi=10.1112/S0025579300011608}}</ref>