Results 1 
3 of
3
Checking the odd Goldbach conjecture up to 10 20
 Math. Comp
, 1998
"... Abstract. Vinogradov’s theorem states that any sufficiently large odd integer is the sum of three prime numbers. This theorem allows us to suppose the conjecture that this is true for all odd integers. In this paper, we describe the implementation of an algorithm which allowed us to check this conje ..."
Abstract

Cited by 7 (1 self)
 Add to MetaCart
Abstract. Vinogradov’s theorem states that any sufficiently large odd integer is the sum of three prime numbers. This theorem allows us to suppose the conjecture that this is true for all odd integers. In this paper, we describe the implementation of an algorithm which allowed us to check this conjecture up to 10 20. 1.
A complete Vinogradov 3primes theorem under the Riemann hypothesis
 ERA Am. Math. Soc
, 1997
"... Abstract. We outline a proof that if the Generalized Riemann Hypothesis holds, then every odd number above 5 is a sum of three prime numbers. The proof involves an asymptotic theorem covering all but a finite number of cases, an intermediate lemma, and an extensive computation. 1. ..."
Abstract

Cited by 6 (1 self)
 Add to MetaCart
Abstract. We outline a proof that if the Generalized Riemann Hypothesis holds, then every odd number above 5 is a sum of three prime numbers. The proof involves an asymptotic theorem covering all but a finite number of cases, an intermediate lemma, and an extensive computation. 1.
EXPLICIT ESTIMATE ON PRIMES BETWEEN CONSECUTIVE CUBES
, 810
"... Abstract. We give an explicit form of Ingham’s Theorem on primes in the short intervals, and show that there is at least one prime between every two consecutive cubes x 3 and (x + 1) 3 if log log x ≥ 15. 1. ..."
Abstract
 Add to MetaCart
Abstract. We give an explicit form of Ingham’s Theorem on primes in the short intervals, and show that there is at least one prime between every two consecutive cubes x 3 and (x + 1) 3 if log log x ≥ 15. 1.