Prove that all even numbers are the sum of two prime numbers.
oooo :)
how dare you ask this question
plz come help me dan
Lol what do you mean?
the wonderful world of primes shud not be explored
Every number be expressed by it's prime factors a even number is always divisible by 2 QED
Same goes for a number ending in 5
If you guys can answer this question I'll give you a medal!... The million dollars is mine >:D
hahaha
2n=p1+p2*p3
This can not be proved. ** It is unsolved problem in number theory yet ** [Goldbach's Conjecture]
thats as far as the prove has gotten for all sufficiently large even numbers
proof*
to solve this question we need a study group with euler euclid and fermat
prolly do it in a day then lol
I do find it interesting though that at first read this question looks deceptively simple yet its been impossible to come up with an equation proving its truth to date.
help ,e plz people come to my stuff
i must help this future number theorist!
Lol
@thesecret20111 you must have mentioned "All even numbers larger than 4" as 2 and 4 don't satisfy this condition.
Goldbach's conjecture is true for larger than 4 even numbers.
4=2X2 two prime numbers
Join our real-time social learning platform and learn together with your friends!