proof of Goldbach conjecture
in [Math]
|
From: Tonico on 1 Dec 2009 05:05 On Dec 1, 8: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 This is a very interesting theorem, taking into account that Goldbach's conjecture deals about proving the existence of such a primes. It's like saying Conjecture: There are pink unicorns that speak greek Proof: First we prove a little theorem Theorem: The conjecture is true if the pink unicorns aren't hungarian...and etc. In the above theorem you're saying: the conjecture that says that every even number greater that 4 is the sum of two primes is true if the two primes (Which ones? The primes whose existence you've first to prove?!) are different...doesn't make much sense, does it? Tonio
From: eestath on 1 Dec 2009 05:27 it is quite simple : if p/= q Goldbach conjecture is true for every k>4 (i proved that a k for which p+q/=2k simply do not exist) if p=q then also is true Take a logic class!
From: eestath on 1 Dec 2009 08:51 integers exist Every integer greater or equal then 2 is a product of primes to an integer power. Thus integers exist!
From: Ki Song on 1 Dec 2009 08:57 On Dec 1, 4:47 am, eestath <stathopoulo...(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! > first i say that is different from > p+q/=2k (integers diferent from integers) > 2^(p+q)=2^(2k) (integers different from integers) > 2*2^(p/q)/=2^(2k/q) > [2*2^(p/q) is allways irrational different from both rational and > irrational 2^(2k/q) but from the assumption it couldn't be > irrational] > So it must be rational. > > p/=q*(2w-1) (integers different from integers or odd different from > odd [contradiction]) Why can't 2^(2k/q) be irrational? You never said anything about q dividing 2k.
From: eestath on 1 Dec 2009 09:58
if 2^(2k/q) is irrational then simply it followes from the assumption p +q/=2k and is true. We are trying to see if there is a solution for witch p+q=2k so our theorem is wrong. Such a solution (k) does not exist. So our theorem is true. |