Goldbach Conjecture states that" Every even integer greater than 2 can be written as sum of two primes"
I think this might be a proof.
Let a number be 2k and let the two primes be 2n+1 and 2m+1. Therefore, 2k=2(m+n+1) k=m+n+1
Therefore, there are infinite many solutions and one of them satisfies the given equation. Goldbach conjecture is true. All who think this is wrong , please comment and make me realize my mistake