|May25-12, 12:04 PM||#1|
Extended Goldbach: every odd number the sum of 5 primes
Terence Tao has submitted a paper to arxiv: [1201.6656] Every odd number greater than 1 is the sum of at most five primes
TT's paper is about closing that gap for the 5-prime case, and I will concede that I find it difficult to follow.
But if his reasoning is sound, then that suggests that we may not be far off from proving Goldbach's conjecture by a similar method, or else making it much easier to find a counterexample.
Could it be possible to find bounds from above for similar unsolved mathematical problems?
The Riemann hypothesis. It's about the zeros of the Riemann zeta function, the values that make it zero. Its trivial zeros are the negative even integers, and the rest are its nontrivial ones. The hypothesis states that all of them have real part 1/2.
Mersenne primes. Mersenne numbers 2prime-1 include primes as far as they have been searched: 243,112,609 – 1 is the largest currently known one. It is not known whether there is a finite or infinite number of them.
Fermat primes. Fermat numbers 22^n+1 include only 5 known primes: n = 0 to 4: 3, 5, 17, 257, 65537. For n = 5 to 32, the Fermat numbers are known to be composite, and it is not known whether or not there are any other Fermat primes.
|May26-12, 01:57 PM||#2|
Go Terence! He's been on a roll lately.
Can't comment on the paper, though; analytic number theory may as well be magic to me.
|Similar Threads for: Extended Goldbach: every odd number the sum of 5 primes|
|Number of Primes Between n and 2n||Linear & Abstract Algebra||15|
|How many primes needed for the GOLDBACH CONJECTURE?||Linear & Abstract Algebra||0|
|Goldbach Number||Calculus & Beyond Homework||0|
|No of primes less than a given number||General Math||5|
|Sum the three primes, get number||Brain Teasers||0|