A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
THE EXCEPTIONAL SET IN THE POLYNOMIAL GOLDBACH PROBLEM
2011
International Journal of Number Theory
Communicated by xxx For each natural number N , let R(N ) denote the number of representations of N as a sum of two primes. Hardy and Littlewood proposed a plausible asymptotic formula for R(2N ) and showed, under the assumption of the Riemann Hypothesis for Dirichlet Lfunctions, that the formula holds "on average" in a certain sense. From this they deduced (under ERH) that all but O (x 1/2+ ) of the even natural numbers in [1, x] can be written as a sum of two primes. We generalize their
doi:10.1142/s1793042111004423
fatcat:rojryjofi5f2fohnie7bzxxbcm