Browse Groups

• ## Re: Problems with Tom's paper on the Goldbach Conjecture

(14)
• NextPrevious
• ... Thank you Richard. I m glad you were able to penetrate it enough to see specific problems. I was able to understand Tom s colloquial version, and
Message 1 of 14 , Sep 3, 2009
View Source
>[snip]
> It seems that your document details a rather longwinded proof of some very elementary results and then rushes over the interesting bits. I would hope to see building blocks for the proof of the Goldbach Conjecture to be set out explicitly as theorems and then for it to be made very clear how these blocks fit together to prove the main result.
>

Thank you Richard. I'm glad you were able to penetrate it enough to see specific problems. I was able to understand Tom's 'colloquial' version, and realized that the core of his proof went from a very elementary result to a QED in two sentences flat. Tom told me that the missing link of proof was found in the full version, but I could not penetrate the set theory nomenclature. My eyes glazed over, even with - note - coffee *and* chocolate by my side.

But the folding idea is an appealing picture, lending itself to a nice rephrasing Goldbach's conjecture: Every integer greater than one is the mean of two primes.

But here's a reality check for attempts at solving GB's conjecture.
We want to show that 2n is the sum of two primes. We draw a line from 0 to 2n, with n in the center:

0.......n.......2n

GB conjecture would have that for every n>1 there is a prime equidistant on either side of n.

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. :)

Mark
• ... Indeed :-) I sometimes wonder why purported provers of the G*ldb*ch conjecture don t criticize Erdos for using central binomial coefficients in his proof
Message 1 of 14 , Sep 3, 2009
View Source
<mark.underwood@...> wrote:

> 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. :)

Indeed :-)

I sometimes wonder why purported provers of the G*ldb*ch conjecture
don't criticize Erdos for using central binomial coefficients in
his proof of Bertrand's postulate, nicely caught here
http://secamlocal.ex.ac.uk/people/staff/rjchapma/etc/bertrand.pdf
by Robin Chapman. The close reasoning in this proof of a result
immensely weaker than the G*ldb*ch conjecture ought to offer
some sort of warning, one might have thought? Of course
it is not beyond the bounds of reason that Chebyshev and Erdos
fooled themselves and the rest us into thinking that even
Betrand's postulate is this hard to prove.

David
• ... 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
View Source
>> 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.
• Changes have not been saved
Press OK to abandon changes or Cancel to continue editing
• Your browser is not supported
Kindly note that Groups does not support 7.0 or earlier versions of Internet Explorer. We recommend upgrading to the latest Internet Explorer, Google Chrome, or Firefox. If you are using IE 9 or later, make sure you turn off Compatibility View.