RE: [PrimeNumbers] Re: Problems with Tom's paper on the Goldbach Conjecture
>> On the way to prove such, of course it would have to be provenNice point mark!
>> that there are indeed primes from n to 2n.
>> Such a little thing. :)
> I sometimes wonder why purported provers of the G*ldb*ch conjectureYes, and that is one of the simplest proofs. It would be kind for these
> don't criticize Erdos for using central binomial coefficients in
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