# Is there way to know if ODD number can be expressed as sum of two primes?

I'm solving problem and I need your help, I know that every even integer can be expressed as sum of two primes and every integer can be expressed as sum of three primes. (for all integers <= 2 * 10^9)

But I want to know is there a way to check can we express odd number as sum of two primes.

• The words "twin prime" come to mind. – hardmath Nov 27 '16 at 20:19
• Technically, we don't "know" that every integer can be expressed as a sum of two primes. Goldbach's conjecture is still open, perhaps the most gotta-be-true unproven conjecture. – Joffan Nov 27 '16 at 20:21
• I needed for number lower than 2*(10^9) and Goldbach's conjecture is proven for numbers up to 4*(10^18) – someone123123 Nov 27 '16 at 20:24
• @someone123123: You are still wrong to claim that "every even integer can be expressed as sum of two primes". – TonyK Nov 28 '16 at 11:55

Sure; if $n-2$ is prime, then yes, otherwise not.
Adding two numbers to get an odd number requires that one of them is odd and the other even, but since there is only one even prime ($2$), the test is simple.
To make the sum of two numbers odd, one of the numbers must be odd and the other even. There is only one even prime, so that limits you to sums of the form $2+p$. Thus the odd numbers that are the sum of two primes are exactly the ones that are two more than a prime. The first few are $$5, 7, 9, 13, 15, 19, 21, 25, 31, 33, 39, 43\ldots$$ Also note that it is not known whether every even number is the sum of two primes. Every single even number that has been checked has been verified to be the sum of two primes, but we don't know whether it is always true.