A community for students.
Here's the question you clicked on:
 0 viewing
anonymous
 5 years ago
Prove that every positive even integer greater than or equal to 4 can be expressed as the sum of two primes.
anonymous
 5 years ago
Prove that every positive even integer greater than or equal to 4 can be expressed as the sum of two primes.

This Question is Closed

amistre64
 5 years ago
Best ResponseYou've already chosen the best response.0I cant even prove that even integers exist :)

anonymous
 5 years ago
Best ResponseYou've already chosen the best response.0Actually I think the question is mistaken, it should have been Every positive even integer greater than 2 can be expressed as the sum of two primes

anonymous
 5 years ago
Best ResponseYou've already chosen the best response.0No that is how the problem is presented word to word.

anonymous
 5 years ago
Best ResponseYou've already chosen the best response.0Googling: ignorant was kinda' right Also: "In 1930, Lev Schnirelmann proved that every even number n ≥ 4 can be written as the sum of at most 20 primes. This result was subsequently improved by many authors; currently, the best known result is due to Olivier Ramaré, who in 1995 showed that every even number n ≥ 4 is in fact the sum of at most six primes. In fact, resolving the weak Goldbach conjecture will also directly imply that every even number n ≥ 4 is the sum of at most four primes.[13] Leszek Kaniecki showed every odd integer is a sum of at most five primes, under Riemann Hypothesis. [14]"

anonymous
 5 years ago
Best ResponseYou've already chosen the best response.0Then I don't have idea. For a moment I thought may be you were talking about Goldbach's conjecture. The statement I provided is Goldbach's conjecture. And it is not yet proved. If you don't mind, may I know the book, the problem is from

anonymous
 5 years ago
Best ResponseYou've already chosen the best response.0The name of this problem is strong Goldbach conjecture in my book.

anonymous
 5 years ago
Best ResponseYou've already chosen the best response.0Then it is wrong, given there, as I know the statement which gave is the right statement

anonymous
 5 years ago
Best ResponseYou've already chosen the best response.0I believe you are talking about the prolem in which number '1' is regarded as a prime. This convention is not used anymore in this version of the prolem.

anonymous
 5 years ago
Best ResponseYou've already chosen the best response.0I meant the statement, that I gave is the right (sorry for the typos)

anonymous
 5 years ago
Best ResponseYou've already chosen the best response.0Whatever it may be, it is a conjecture

anonymous
 5 years ago
Best ResponseYou've already chosen the best response.0You seem familiar with this here is some more detalied information from Wolfram mathworld: http://mathworld.wolfram.com/GoldbachConjecture.html

anonymous
 5 years ago
Best ResponseYou've already chosen the best response.0Whatever it may be its a conjecture

anonymous
 5 years ago
Best ResponseYou've already chosen the best response.0I woudn't have been sitting here if I would been able to prove a conjecture

anonymous
 5 years ago
Best ResponseYou've already chosen the best response.0Bit odd of our lecturer to have this task included in our course paper. If someone here gets a spark to solve this it would be good though.

anonymous
 5 years ago
Best ResponseYou've already chosen the best response.0But Pasi, its a conjecture, it means it is yet not proven by anyone

anonymous
 5 years ago
Best ResponseYou've already chosen the best response.0How can you expect it to be proved by some one here

anonymous
 5 years ago
Best ResponseYou've already chosen the best response.0Your lecturer is perhaps playing a little joke with you

anonymous
 5 years ago
Best ResponseYou've already chosen the best response.0I don't really expect, but it cant do any harm either. I agree with the joke part now that I familiarized my self with the conjecture.

anonymous
 5 years ago
Best ResponseYou've already chosen the best response.0You will find something here http://en.wikipedia.org/wiki/Goldbach's_conjecture

anonymous
 5 years ago
Best ResponseYou've already chosen the best response.0Considerable efforts seem to have been made to prove this conjeture and I'm sure someday it will be proved. Thank you for the link. Here is another one full of unsolved problems: http://garden.irmacs.sfu.ca/ This types of problems sure seem intriguing.
Ask your own question
Sign UpFind more explanations on OpenStudy
Your question is ready. Sign up for free to start getting answers.
spraguer
(Moderator)
5
→ View Detailed Profile
is replying to Can someone tell me what button the professor is hitting...
23
 Teamwork 19 Teammate
 Problem Solving 19 Hero
 Engagement 19 Mad Hatter
 You have blocked this person.
 ✔ You're a fan Checking fan status...
Thanks for being so helpful in mathematics. If you are getting quality help, make sure you spread the word about OpenStudy.