Search All of the Math Forum:

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.

Topic: A proof for Goldbach's conjecture
Replies: 12   Last Post: Aug 1, 2001 7:44 AM

 Messages: [ Previous | Next ]
 Peter Percival Posts: 339 Registered: 12/6/04
Re: A proof for Goldbach's conjecture
Posted: Jul 28, 2001 5:14 AM

Entropix wrote:
>
> That's irrelavent. If you look at his proof he starts counting evens with 6.

each even number is sum of two prime numbers." Note that, even if he
did prove Goldbach's conjecture he would not have fulfilled his purpose.

Note also that I refer to only the first of a number of illogical uses
of the infinite.

Cheers, PP

>
> "Peter Percival" <peter.percival@cwcom.net> wrote in message
> news://3B60A2F7.8E02B687@cwcom.net...

> > > "Hamid V. Ansari" wrote:
> > >
> > > If you want the text of this article witten in LaTeX send me an email.
> > >
> > > http://www.netnormal.com/users/elmiran/0.doc
> > >
> > >
> > > A proof for Goldbach's conjecture
> > >
> > > two prime numbers. For this, we first should prove that for an
> > > infinitely
> > > large even number there exist infinite pairs of prime numbers that the

> >
> > But first, what's an infinitely large even number? And first before
> > that, note that 2 is not the sum of two prime numbers.
> >
> >

Date Subject Author
7/26/01 Hamid V. Ansari
7/26/01 Peter Percival
7/26/01 W. Dale Hall
7/26/01 Geoff Harland