I think I can prove Goldbachs conjecture :-)

proof:

Every even integer greater than 2 can be expressed as the sum of two primes

My theory:
----------------------
(every integer greater then 3) - (prime number>2)= "always" (an uneven integer, not a prime number)

2N = Pn + A
and I assume that this is the case for every prime number 2< Pn <2N
N>3
A = uneven integer, not prime
--------------------------
If this is correct this means:

4N = 2N+2N = Pn + Pn + 2A

2(2N-A)= even integer = Pn + Pn --> this contradicts my assumption:

So I have proven for N>3 and every prime Pn, if 2N > Pn >2

2N - Pn = "not always" (an uneven integer, not prime)!
it is a fact that if Pn>2:
2N - Pn = "always uneven

so you know:

in at least 1 case: 2N - Pn must be an uneven number and also a Primenumber.

in this case: even integer = Pn + Pn = conjecture of Goldbach