Dong Min Son

Unregistered less info
2 reputation
2
bio website
location
age
visits member for 1 year, 6 months
seen Oct 5 '12 at 13:55

Oct
3
comment Is this a valid proof of the Goldbach's theorem?
Ah, ok now I get it. We need the formula to obtain all the prime numbers, and that's the thing that makes the theorem so difficult to prove. Ok, thanks.
Oct
3
comment Is this a valid proof of the Goldbach's theorem?
Wait, does that mean I've just proved the theorem?
Oct
3
comment Is this a valid proof of the Goldbach's theorem?
You can obtain any even integer with 2m + 2n + 2, including 4 and 2. For example: 2(o)+2(0)+2 = 2, 2(1)+2(0)+2 = 4 and so on.
Oct
3
awarded  Commentator
Oct
3
comment Is this a valid proof of the Goldbach's theorem?
I am just a freshman and am taking discrete mathematics this semester, so perhaps I don't know what I am talking about. But if mathematics cannot prove something as obvious as 2 + 2 = 4, then there's something wrong with math. Perhaps, the concepts we use right now are TOO LIMITED in scope.
Oct
3
comment Is this a valid proof of the Goldbach's theorem?
2m+1 and 2p+1 can express any odd number and can thus express any pair of prime numbers. We can generalize from that and say that since they always give an even number, it follows that any pair of odd prime numbers gives an even number. It's like saying that "proving for all odd prime number" is a subset of "proving for all odd number" if that makes any sense.
Oct
3
comment Is this a valid proof of the Goldbach's theorem?
I was trying to point out that we need to prove it for 2 and then prove it for all other prime numbers, which are odd.
Oct
3
comment Is this a valid proof of the Goldbach's theorem?
So, are you saying that any sum of two odd prime is an even integer =/= any even integer can be written as the sum of two primes? Because if that's the case, you misunderstood me.
Oct
3
comment Is this a valid proof of the Goldbach's theorem?
Every prime is odd, except 2.
Oct
3
comment Is this a valid proof of the Goldbach's theorem?
Basically, I am saying that prime numbers must be odd, so if we prove that the summation of two odd numbers gives an even integer, we also prove the conjecture, since all prime numbers are odd, except 2 and 4, which we can prove by exhaustion.
Oct
3
comment Is this a valid proof of the Goldbach's theorem?
Every summation of two prime numbers can be expressed as 2n + 2m + 2, which comes from the prime numbers 2n + 1 and 2m + 1. We can actually use that to prove it for 4 and 2. We just need to set m or n to 0.
Oct
3
awarded  Editor
Oct
3
asked Is this a valid proof of the Goldbach's theorem?
Sep
30
comment Does this proposition really prove that n is not a prime?
Ah, I see. n can't divide a. I thought the notation meant a can't divide n.
Sep
30
comment Does this proposition really prove that n is not a prime?
How is 4 not divisible by 2?
Sep
30
asked Does this proposition really prove that n is not a prime?