Loading ...
Sorry, an error occurred while loading the content.
 

RE: [PrimeNumbers] Re: Problems with Tom's paper on the Goldbach Conjecture

Expand Messages
  • Chris Caldwell
    ... Nice point mark! ... Yes, and that is one of the simplest proofs. It would be kind for these provers to offer us a half-page proof of the Bertrand result
    Message 1 of 14 , Sep 3, 2009
      >> On the way to prove such, of course it would have to be proven
      >> that there are indeed primes from n to 2n.
      >> Such a little thing. :)

      Nice point mark!

      > I sometimes wonder why purported provers of the G*ldb*ch conjecture
      > don't criticize Erdos for using central binomial coefficients in

      Yes, and that is one of the simplest proofs. It would be kind for these
      provers to offer us a half-page proof of the Bertrand result which is so

      much simpler than Goldbach. What a fine way to catch the attention of
      mathematicians that would be... CC
    Your message has been successfully submitted and would be delivered to recipients shortly.