Counterexamples
Goldbach's conjecture states that every even integer greater than 2 can be written as the sum of two prime numbers (for example, ). So far, no one has been able to prove the validity of this conjecture or find a counterexample. What would a counterexample consist of?
A. An odd integer greater than 2 that can be written as the sum of two prime numbers.
B. An even integer greater than 2 that can be written as the sum of two prime numbers.
C. An even integer greater than 2 that can't be written as the sum of two prime numbers.
D. An odd integer greater than 2 that can't be written as the sum of two prime numbers.
E. None of these are counterexamples.
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
1 solution
The conjecture is talking about even integers, so A and D are out. B is what the conjecture is stating, so it is out. If we find an example of C, then this goes against the conjecture directly. C is the answer.