Goldbach conjecture Proof

Developed by Geraldo Pinto Lucas Gomes on 11/16/2004

Comments and suggestions for

[dalibormaksimovic]

So. I can relate to proof. If Goldbach conjecture holds for every arbitrary even number n, then we can set n=12. Obviously, 12 is the sum of two primes, and that's the end of my proof.

[IshanBanerjee]

But sir you are assuming that W is a multiple of N and Q where as the theorem is valid for any even number .

[dalibormaksimovic]

Even if we assumed you proved that N, Q must be different from 1, you still have to show that when N=Q=1 will always work.
But your proof is wrong. Who says that N or Q must divide W?

[pelayopalacio]

Hi,
Observations at time 0:16
1) When you define W=10NQ you are going to prove the result only for the even number that are multiple of 10. What happens with the ones that are not?
2) What allows you to state that W = Np1 + Qp2 and that W = 10NQ? Why doequantities, Np1 + Qp2 and 10NQ should be equal? (see next point)
3) Case W=40, If I choose 40 = 25 + 75 = 5*5 + 25*3 your "only has solution for N and Q are coprimes" is false (gcd(5, 25)=5).
Moreover, W = 40 = 17+ 23 = 1*17 + 1*23 (gcd(1, 1)=1) but 40 is not 10*1*1=10