proof of Goldbach conjecture
in [Math]
|
From: Arturo Magidin on 1 Dec 2009 12:00 On Dec 1, 12:09 am, eestath <stathopoulo...(a)gmail.com> wrote: > Goldbach conjecture states that every even integer greater then 4 is > the sum of two primes > > Proof > > Theorem > > Golbach conjecture is true for every n>4 if the two prime numbers are > different Sorry, I don't follow. (And you forgot "even" didn't you?) Let n be an even integer greater than 4. Which "two prime numbers" do you refer to in the statement of this "Theorem"? You cannot assume that there are two prime numbers p and q such that p+q = n, because that is what Goldbach's Conjecture asserts, and this is what you are trying to prove. So which "two prime numbers" are we looking at? Where do they come from? (Note that your "Theorem" is of the form: 'If for every n>4, 'the two prime numbers p and q satisfy p=/=q', then for every m>4, if m is even then m is the sum of two prime numbers.' So, what are p and q? How are they related to n? (Don't tell me to look at the proof of the "Theorem"; first, I want to understand what the statement *says*) -- Arturo Magidin
From: eestath on 1 Dec 2009 12:18 I assume that p+q /= 2k for some k>2 (if p/=q) and i simply prove that it does not exist such k!
From: Arturo Magidin on 1 Dec 2009 12:22 On Dec 1, 11:18 am, eestath <stathopoulo...(a)gmail.com> wrote: > I assume that p+q /= 2k for some k>2 (if p/=q) and i simply prove that > it does not exist such k! On its face, this is absurd. If p and q are odd numbers, then there *certainly* exist a k such that p+q =/= 2k. So you are either saying something that is nonsense, or you are not saying what you mean. But this is completely irrelevant to my question. You did not answer my question. Kindly address that question rather than simply repeat sentences that, on their face, are nonsense. You state: > Theorem > Golbach conjecture is true for every n>4 if the two prime numbers are > different expanding a bit, this means that you are stating: THEOREM. If for every n>4, the two prime numbers p and q satisfy p=/=q, then for every m>4, if m is even then m is the sum of two prime numbers. What are "the two prime numbers p and q"? How are they related to a given n>4? -- Arturo Magidin
From: Virgil on 1 Dec 2009 14:51 In article <076332b6-e43e-48c1-8c16-f6a39fc5f2ae(a)o10g2000yqa.googlegroups.com>, eestath <stathopoulosee(a)gmail.com> wrote: > On Dec 1, 9:30�am, Virgil <Vir...(a)home.esc> wrote: > > In article > > <bfe9e50f-05d8-41ac-87f7-cfd50b55a...(a)f16g2000yqm.googlegroups.com>, > > > > �eestath <stathopoulo...(a)gmail.com> wrote: > > > Goldbach conjecture states that every even integer greater then 4 is > > > the sum of two primes > > > > > Proof > > > > > Theorem > > > > > Golbach conjecture is true for every n>4 if the two prime numbers are > > > different > > > > How about finding two different primes adding up to n = 6 ? > if p=q is Conjecture is sutisfied... Your statement "Golbach conjecture is true for every n>4 if the two prime numbers are different" is equivalent to saying that every integer greater than 4 is the sum of two DIFFERENT primes But that is false for the integer 6!
From: Tim Little on 1 Dec 2009 19:59
On 2009-12-01, eestath <stathopoulosee(a)gmail.com> wrote: > I explain every time what different from means is easy to understand > what i am talking about if you read carefully! Yes, easy to understand. Also esy to see why it's completely wrong. Have fun with your future trolling! - Tim |