Every prime greater than 7 can be written as the sum of two primes

In summary, every prime greater than 7, P, can be written as the sum of two primes, A and B, and the subtraction of a third prime, C, in the form (A+B)-C, where A is not identical to B or C, B is not identical to C, and A, B, and C are less than P. However, this cannot be done with the number 11 because 1, which is defined to be prime, cannot be used as C in the equation. Therefore, the proposition is disproven.
  • #1
DbL
5
0
"Every prime greater than 7, P, can be written as the sum of two primes, A and B, and the subtraction of a third prime, C, in the form (A+B)-C, where A is not identical to B or C, B is not identical to C, and A, B, and C are less than P."

True?
 
Physics news on Phys.org
  • #2
Can this be done with 11?
 
Last edited:
  • #3
Do you mean prime or relatively prime?
 
  • #4
robert1986 said:
can this be done with 11?

(7+5)-1
 
  • #5
Robert1986 said:
Do you mean prime or relatively prime?

prime
 
  • #6
DbL said:
(7+5)-1

1 is not a prime.
 
  • #7
Curious3141 said:
1 is not a prime.

That is correct.

The number 1 is not considered a prime, although it is a unique integer. The definition of a "prime" number is one that has exactly TWO factors: itself and 1. So the number 1, having only ONE factor, itself, does not meet the definition.
 
  • #8
DbL said:
That is correct.

The number 1 is not considered a prime, although it is a unique integer. The definition of a "prime" number is one that has exactly TWO factors: itself and 1. So the number 1, having only ONE factor, itself, does not meet the definition.

OK, C (defined to be prime) cannot be 1.

Your proposition is disproven.

11 is a counterexample.
 

FAQ: Every prime greater than 7 can be written as the sum of two primes

What is the significance of the statement "Every prime greater than 7 can be written as the sum of two primes"?

The statement is also known as Goldbach's conjecture and has been a topic of mathematical research for over 270 years. It suggests that every even number greater than 2 can be written as the sum of two prime numbers. This has implications in number theory and cryptography.

Is Goldbach's conjecture proven to be true?

No, Goldbach's conjecture is still an unsolved problem in mathematics. While it has been verified for many numbers, there is no formal proof that it holds true for all even numbers.

Are there any counterexamples to Goldbach's conjecture?

There are no known counterexamples to Goldbach's conjecture. All even numbers tested so far have been found to be the sum of two primes. However, this does not serve as a proof for the conjecture.

What progress has been made towards proving Goldbach's conjecture?

Many mathematicians have attempted to prove Goldbach's conjecture, but it remains an open problem. Some progress has been made, such as the proof of weaker versions of the conjecture and the verification of the conjecture for larger numbers. However, a complete proof is yet to be found.

What are the potential implications of proving or disproving Goldbach's conjecture?

If Goldbach's conjecture is proven to be true, it could potentially have far-reaching implications in number theory and cryptography. On the other hand, if it is proven to be false, it could lead to new insights and advancements in the field of mathematics.

Back
Top