Hardy and Littlewood first showed that the generalized Riemann hypothesis could be used to prove the weak version of this for sufficiently large numbers, while Ivan Vinogradov proved it without the assumption for numbers greater than approximately 10 to the 6 million.
Hardy and Littlewood first showed that the generalized Riemann hypothesis could be used to prove the weak version of this for sufficiently large numbers, while Ivan Vinogradov proved it without the assumption for numbers greater than approximately 10 to the 6 million. Schnierlmann proved that it could be done by using at most 300,000 primes, slightly larger than the 2 originally stated in the conjecture. For ten points, what is this conjecture stating that every even number greater than 2 can be expressed as the sum of two primes?
Hardy and Littlewood first showed that the generalized Riemann hypothesis could be used to prove the weak version of this for sufficiently large numbers, while Ivan Vinogradov proved it without the assumption for numbers greater than approximately 10 to the 6 million.
Goldbach conjecture