Guest Posted April 9, 2008 Report Share Posted April 9, 2008 Every even integer greater than 2 can be written as the sum of two primes, where 1 is not prime. Prove / disprove. Quote Link to comment Share on other sites More sharing options...
0 grey cells Posted April 9, 2008 Report Share Posted April 9, 2008 Every even integer greater than 2 can be written as the sum of two primes, where 1 is not prime. Prove / disprove. 4 does not come under this category. 3+1=4 But 1 is non-prime. Quote Link to comment Share on other sites More sharing options...
0 Guest Posted April 9, 2008 Report Share Posted April 9, 2008 4 does not come under this category. 3+1=4 But 1 is non-prime. how about 2+2=4 ... OP doesn't state the prime numbers must be distinct, right? I think it is called Goldbach's conjecture ... Bonanova said something interesting about it before. This time he may say more ... Quote Link to comment Share on other sites More sharing options...
0 Guest Posted April 9, 2008 Report Share Posted April 9, 2008 Every even integer greater than 2 can be written as the sum of two primes, where 1 is not prime. Prove / disprove. I'd like to see the proof here, because as far as I know, it is as of yet unproven. It has been shown that the probability of this is great, but not proven. Quote Link to comment Share on other sites More sharing options...
0 Guest Posted April 9, 2008 Report Share Posted April 9, 2008 you might be able to disprove it but I don't think you could prove it without also coming up with formula for primes, which as yet, doesn't exist. They just happen! Quote Link to comment Share on other sites More sharing options...
0 Guest Posted April 9, 2008 Report Share Posted April 9, 2008 This is a very famous mathematical problem called the Goldberg Conjecture. I don't believe even the best mathematicians in the world have proved this over centuries of trying. You can google it on the internet to find out more. Quote Link to comment Share on other sites More sharing options...
0 Guest Posted April 9, 2008 Report Share Posted April 9, 2008 This is a very famous mathematical problem called the Goldberg Conjecture. I don't believe even the best mathematicians in the world have proved this over centuries of trying. You can google it on the internet to find out more. i didn't really feel like trying this problem as maths is not really my "forte" to say, but nevertheless i did google it and this is what i got First, any prime number is odd, so it can be written 2n + 1 for some integer n. Next, we write 2n + 1 = n2 - n2 + 2n + 1 = (n + 1)2 - n2, a difference of two squares. i don't fully understand this but in general kinda feel it works Quote Link to comment Share on other sites More sharing options...
Question
Guest
Every even integer greater than 2 can be written as the sum of two primes, where 1 is not prime. Prove / disprove.
Link to comment
Share on other sites
6 answers to this question
Recommended Posts
Join the conversation
You can post now and register later. If you have an account, sign in now to post with your account.