Every integer greater than 5 is the sum of three primes?

AI Thread Summary
Every integer greater than 5 can be expressed as the sum of three primes, which is proven through two cases: when the integer is even and when it is odd. For even integers, the proof utilizes Goldbach's conjecture to show that subtracting 2 from the integer results in another even number that can be expressed as the sum of two primes. For odd integers, subtracting 3 yields an even number that can also be expressed as the sum of two primes. The discussion highlights the equivalence between the Goldbach conjecture for even integers greater than 2 and the statement regarding integers greater than 5. This establishes a foundational link between these two conjectures in number theory.
Math100
Messages
813
Reaction score
229
Homework Statement
Prove that the Goldbach conjecture that every even integer greater than ## 2 ## is the sum of two primes is equivalent to the statement that every integer greater than ## 5 ## is the sum of three primes.
[Hint: If ## 2n-2=p_{1}+p_{2} ##, then ## 2n=p_{1}+p_{2}+2 ## and ## 2n+1=p_{1}+p_{2}+3 ##.]
Relevant Equations
None.
Proof:

Let ## a>5 ## be an integer.
Now we consider two cases.
Case #1: Suppose ## a ## is even.
Then ## a=2n ## for ## n\geq 3 ##.
Note that ## a-2=2n-2=2(n-1) ##,
so ## a-2 ## is even.
Applying Goldbach's conjecture produces:
## 2n-2=p_{1}+p_{2} ## as a sum of two primes ## p_{1} ## and ## p_{2} ##.
Thus ## 2n=p_{1}+p_{2}+2 ## is a sum of three primes.
Case #2: Suppose ## a ## is odd.
Then ## a=2n+1 ## for ## n\geq 3 ##.
Note that ## a-3=2n-2=2(n-1) ##,
so ## a-3 ## is also even.
Applying Goldbach's conjecture produces:
## a-3=p_{1}+p_{2} ## as a sum of two primes ## p_{1} ## and ## p_{2} ##.
Thus ## 2n+1=p_{1}+p_{2}+3 ## is a sum of three primes.
Therefore, the Goldbach conjecture that every even integer greater than ## 2 ## is the
sum of two primes is equivalent to the statement that every integer greater than ## 5 ##
is the sum of three primes.
 
Physics news on Phys.org
Math100 said:
Homework Statement:: Prove that the Goldbach conjecture that every even integer greater than ## 2 ## is the sum of two primes is equivalent to the statement that every integer greater than ## 5 ## is the sum of three primes.
[Hint: If ## 2n-2=p_{1}+p_{2} ##, then ## 2n=p_{1}+p_{2}+2 ## and ## 2n+1=p_{1}+p_{2}+3 ##.]
Relevant Equations:: None.

Proof:

Let ## a>5 ## be an integer.
Now we consider two cases.
Case #1: Suppose ## a ## is even.
Then ## a=2n ## for ## n\geq 3 ##.
Note that ## a-2=2n-2=2(n-1) ##,
so ## a-2 ## is even.
Applying Goldbach's conjecture produces:
## 2n-2=p_{1}+p_{2} ## as a sum of two primes ## p_{1} ## and ## p_{2} ##.
Thus ## 2n=p_{1}+p_{2}+2 ## is a sum of three primes.
Case #2: Suppose ## a ## is odd.
Then ## a=2n+1 ## for ## n\geq 3 ##.
Note that ## a-3=2n-2=2(n-1) ##,
so ## a-3 ## is also even.
Applying Goldbach's conjecture produces:
## a-3=p_{1}+p_{2} ## as a sum of two primes ## p_{1} ## and ## p_{2} ##.
Thus ## 2n+1=p_{1}+p_{2}+3 ## is a sum of three primes.
Therefore, the Goldbach conjecture that every even integer greater than ## 2 ## is the
sum of two primes is equivalent to the statement that every integer greater than ## 5 ##
is the sum of three primes.
You have shown that given Goldbach then every positive integer greater than five is a sum of three primes.

What is left to show is: If every integer ##n>5## can be written as ##n=p_1+p_2+p_3## the sum of three primes, then every even positive integer greater than two is the sum of two primes.

Equivalence means that one statement implies the other and the other way round.

(Forget about the greater than conditions. Just show it for integers great enough.)
 
  • Like
Likes Prof B and Math100
Let ## a>5 ## be an integer.
Now we consider two cases.
Case #1: Suppose ## a ## is even.
Then ## a=2n ## for ## n\geq 3 ##.
Note that ## a-2=2n-2=2(n-1) ##,
so ## a-2 ## is even.
Applying Goldbach's conjecture produces:
## 2n-2=p_{1}+p_{2} ## as a sum of two primes ## p_{1} ## and ## p_{2} ##.
Thus ## 2n=p_{1}+p_{2}+2 ## is a sum of three primes.
Case #2: Suppose ## a ## is odd.
Then ## a=2n+1 ## for ## n\geq 3 ##.
Note that ## a-3=2n-2=2(n-1) ##,
so ## a-3 ## is also even.
Applying Goldbach's conjecture produces:
## a-3=p_{1}+p_{2} ## as a sum of two primes ## p_{1} ## and ## p_{2} ##.
Thus ## 2n+1=p_{1}+p_{2}+3 ## is a sum of three primes.
Conversely, suppose every integer ## a>5 ## is the sum of three primes
such that ## a=p_{1}+p_{2}+p_{3} ##.
Let ## a>2 ## be an even integer.
Then ## a+2=2n+2 ## is even and ## a+2>5 ##.
Thus ## a+2=p_{1}+p_{2}+p_{3} ## is the sum of three primes ## p_{1}, p_{2} ## and ## p_{3} ##.
Since ## a+2 ## is even,
it follows that at least one of ## p_{1}, p_{2} ## and ## p_{3} ## must be ## 2 ##.
Without loss of generality, assume ## p_{3}=2 ##.
Then ## a+2=p_{1}+p_{2}+2 ##.
Thus ## a=p_{1}+p_{2} ## is a sum of two primes.
Therefore, the Goldbach conjecture that every even integer greater than ## 2 ##
is the sum of two primes is equivalent to the statement that every integer
greater than ## 5 ## is the sum of three primes.
 
  • Like
Likes Prof B and fresh_42
Looks good.
 
Thank you.
 
Back
Top