Search All of the Math Forum:
Views expressed in these public forums are not endorsed by
Drexel University or The Math Forum.


Math Forum
»
Discussions
»
sci.math.*
»
sci.math
Topic:
Help requested understanding Erdos's proof of Sylvester's theorem that, if n >= 2k, n choose k has a prime divisor > k
Replies:
4
Last Post:
Apr 22, 2014 1:49 AM



Paul
Posts:
474
Registered:
7/12/10


Help requested understanding Erdos's proof of Sylvester's theorem that, if n >= 2k, n choose k has a prime divisor > k
Posted:
Apr 21, 2014 5:01 AM


I'm stuck on a proof of Sylvester's theorem that, if n >= 2k, n choose k has a prime divisor > k.
The proof is available from the URL: http://profs.sci.univr.it/~bellin/philsci/Erdos.pdf
I don't follow why the claim (3) on page 285 holds, although I follow everything up to that.
Alternatively, if anyone can refer me to a free online proof of the same result, that would also be of great interest.
Thank You,
Paul Epstein



