proof of Goldbach conjecture
in [Math]
|
From: Aatu Koskensilta on 2 Dec 2009 00:31 eestath <stathopoulosee(a)gmail.com> writes: > please try to understand... So you don't want to assert not-A after all? -- Aatu Koskensilta (aatu.koskensilta(a)uta.fi) "Wovon man nicht sprechan kann, dar�ber muss man schweigen" - Ludwig Wittgenstein, Tractatus Logico-Philosophicus
From: eestath on 2 Dec 2009 00:34 I simply tell that: Suppose that exist a k such that p+q/=2k An i prove that it does not exist such a k. I said k>2 so 2k>4 so the two prime numbers are odd....
From: Arturo Magidin on 2 Dec 2009 00:38 On Dec 1, 11:34 pm, eestath <stathopoulo...(a)gmail.com> wrote: > I simply tell that: > > Suppose that exist a k such that p+q/=2k > > An i prove that it does not exist such a k. You are still (i) talking nonsense; and (ii) not answering my question. Is it because you are incapable of (i) making sense and (ii) answering the question? If the answer to either of these two is "yes", then please stop responding. You write: > Theorem > Golbach conjecture is true for every n>4 if the two prime numbers are > different This is *exactly the same* as saying: "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. " My question, AGAIN: what are "the" prime numbers p and q, and how are they related to n? Don't tell me what you "simply say". Don't tell me I don't "understand". Don't tell me I'm not trying. ANSWER THE QUESTION, or shut up. -- Arturo Magidin > > I said k>2 so 2k>4 so the two prime numbers are odd....
From: clicliclic on 2 Dec 2009 01:12 eestath schrieb: > > Goldbach conjecture states that every even integer greater then 4 is > the sum of two primes Commonly, the conjecture is stated for every even integer >= 4, or equivalently, every even integer > 3. > > Proof This is the wrong group. Elementary proofs of this conjecture are dealt with over in sci.math. > > Golbach conjecture is true for every n>4 if the two prime numbers are > different You do not seem to understand what the conjecture says; perhaps this expanded wording helps: For every even integer N >= 4 there exist two prime numbers p and q such that N = p+q. > > [...] > > If p=q Goldbach conjecture is true. > Your statements are nonsense; you must show that at least one such pair of prime numbers exists for every N >= 4. For more explanation, please try sci.math. Martin.
From: Aatu Koskensilta on 2 Dec 2009 01:11
eestath <stathopoulosee(a)gmail.com> writes: > Suppose that exist a k such that p+q/=2k > > An i prove that it does not exist such a k. You prove there is no k such that the sum of p and q is not equal to 2k? This would be a startling result. But of course, as others have already helpfully pointed out, your proof is, unfortunately, nothing but pointless babble. -- Aatu Koskensilta (aatu.koskensilta(a)uta.fi) "Wovon man nicht sprechan kann, dar�ber muss man schweigen" - Ludwig Wittgenstein, Tractatus Logico-Philosophicus |