Catch up on stories from the past week (and beyond) at the Slashdot story archive

 



Forgot your password?
typodupeerror

Slashdot videos: Now with more Slashdot!

  • View

  • Discuss

  • Share

We've improved Slashdot's video section; now you can view our video interviews, product close-ups and site visits with all the usual Slashdot options to comment, share, etc. No more walled garden! It's a work in progress -- we hope you'll check it out (Learn more about the recent updates).

×
Math

+ - Goldbach Conjecture - Closer to Solved? ->

Submitted by mikejuk
mikejuk (1801200) writes "The Goldbach conjecture is not the sort of thing that relates to practical applications, but they used to say the same thing about electricity.
The Goldbach conjecture is reasonably well known:
every integer can be expressed as the sum of two primes.
Very easy to state, but it seems very difficult to prove.
Terence Tao, a Fields medalist, has published a paper that proves that every odd number greater than 1 is the sum of at most five primes. This may not sound like much of an advance, but notice that there is no stipulation for the integer to be greater than some bound. This is a complete proof of a slightly lesser conjecture, and might point the way to getting the number of primes needed down from at most five to at most 2.
Notice that no computers where involved in the proof — this is classical mathematical proof involving logical deductions rather than exhaustive search."

Link to Original Source
This discussion was created for logged-in users only, but now has been archived. No new comments can be posted.

Goldbach Conjecture - Closer to Solved?

Comments Filter:

"Freedom is still the most radical idea of all." -- Nathaniel Branden

Working...