Authors
P Erdős, RL Graham
Publication date
2020/2/2
Description
The central binomial coefficient (2n; n) is never squarefree for n> 4. This was proved true for all sufficiently large n by Sárkőzy's theorem. Goetgheluck (1988) proved the conjecture true for 4< n<= 2^(42205184) and Vardi (1991) for 4< n< 2^(774840978). The conjecture was proved true in its entirety by Granville and Ramare (1996).
Scholar articles