Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

Show that every even natural number grater than $2$ can be expressed as a sum of two prime numbers. No idea how to prove this. Can you help? thanks

share|cite|improve this question
    
You might want to have a look at this: en.wikipedia.org/wiki/Goldbach%27s_conjecture – Abel May 2 '13 at 14:54
2  
Let me know if you find a proof of this. We can publish it together :-). – user17762 May 2 '13 at 14:55
    
You are not alone. – Rankeya May 2 '13 at 14:55
3  
Tough course you are taking, if this is homework! Solving it would put you on the front pages of newspapers. – André Nicolas May 2 '13 at 14:59
    
@AndréNicolas: Some of the conjectures in the past were solved by mistake in the past.(Teachers left them as open problems in home assignments). – Inceptio May 2 '13 at 15:06
up vote 6 down vote accepted

This is known as Goldbach's conjecture. This still remains unproved till date. I bet you will make a great fame if you find the proof. All the best with that.:)

share|cite|improve this answer
3  
got it, my lecturer trolled me, didn't know of this conjecture, thanks for link – bateman May 2 '13 at 15:01

Well, it's either the sum of an odd prime +2 or the sum of two odd primes which is always an even number. The sum of an odd prime + 2 is always odd, so we can scratch out the prime 2 and focus on the odd primes.

So then ask, does the combination of all odd primes taken two at a time cover every even number? And the answer is yes.

Ducks.

share|cite|improve this answer

Your Answer

 
discard

By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.