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

In summary, the Goldbach conjecture states that every even integer greater than 2 is the sum of two prime numbers. If every integer greater than 5 is the sum of three prime numbers, then every even integer greater than two is the sum of two prime numbers.
  • #1
Math100
756
201
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
  • #2
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
  • #3
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
  • #5
Thank you.
 

1. What is the significance of the statement "Every integer greater than 5 is the sum of three primes?"

The statement is known as Goldbach's conjecture and it suggests that every even number greater than 2 can be expressed as the sum of two prime numbers. This statement has been a topic of interest for mathematicians for centuries.

2. Is there any proof for this statement?

As of now, there is no mathematical proof for Goldbach's conjecture. However, it has been tested and verified for all even numbers up to 4 x 10^18, making it a strong candidate for being true.

3. How does this statement relate to the distribution of prime numbers?

The statement suggests that every integer greater than 5 can be expressed as the sum of three primes, which indicates that prime numbers are evenly distributed among even numbers. This has implications for understanding the distribution of prime numbers and their relationship with other numbers.

4. Are there any counterexamples to this statement?

So far, no counterexamples have been found for Goldbach's conjecture. However, the statement has not been proven, so it is always possible that a counterexample could be discovered in the future.

5. What are the potential real-world applications of this statement?

The statement has no direct practical applications, but it has implications for number theory and the study of prime numbers. Additionally, it has been used in cryptography and security algorithms.

Similar threads

  • Precalculus Mathematics Homework Help
Replies
6
Views
1K
  • Precalculus Mathematics Homework Help
Replies
13
Views
1K
  • Precalculus Mathematics Homework Help
Replies
4
Views
1K
  • Precalculus Mathematics Homework Help
Replies
4
Views
1K
  • Precalculus Mathematics Homework Help
Replies
14
Views
1K
  • Precalculus Mathematics Homework Help
Replies
10
Views
900
  • Precalculus Mathematics Homework Help
Replies
10
Views
810
  • Precalculus Mathematics Homework Help
Replies
19
Views
760
  • Precalculus Mathematics Homework Help
Replies
10
Views
797
  • Precalculus Mathematics Homework Help
Replies
7
Views
1K
Back
Top