## The exceptional set of Goldbach numbers (II)

### Volume 92 / 2000

#### Abstract

1. Introduction. A positive number which is a sum of two odd primes is called a Goldbach number. Let E(x) denote the number of even numbers not exceeding x which cannot be written as a sum of two odd primes. Then the Goldbach conjecture is equivalent to proving that E(x) = 2 for every x ≥ 4. E(x) is usually called the exceptional set of Goldbach numbers. In [8] H. L. Montgomery and R. C. Vaughan proved that $E(x) = O(x^{1-Δ})$ for some positive constant Δ > 0$. In [3] Chen and Pan proved that one can take Δ >0.01. In [6], we proved thatE(x) = O(x^{0.921})$. In this paper we prove the following result. Theorem. For sufficiently large x, $E(x) =O (x^{0.914})$. Throughout this paper, ε always denotes a sufficiently small positive number that may be different at each occurrence. A is assumed to be sufficiently large, A < Y, and $D = Y^{1+ε}$.