Views expressed in these public forums are not endorsed by
NCTM or The Math Forum.
Notice: We are no longer accepting new posts, but the forums will continue to be readable.
Help requested understanding Erdos's proof of Sylvester's theorem that, if n >= 2k, n choose k has a prime divisor > k
Apr 22, 2014 1:49 AM