Chen's double sieve, Goldbach's conjecture and the twin prime problem
Chen's double sieve, Goldbach's conjecture and the twin prime problem
复制标题
DOI：
10.4064/aa131-4-5
复制
发表时间：
2007-05
期刊：
影响因子：
0.7
通讯作者：
Jie Wu
中科院分区：
文献类型：
--
作者：
Jie Wu
对于每个偶数整数 N ，分别用 D(N) 和 D1,2(N) 表示 N 表示为两个素数之和以及一个素数与最多具有两个素数因子的整数之和的数量。本文给出了D(N)的新上界和D1,2(N)的新下界，改进了Chen的相应结果。对于孪生素数问题我们也得到了类似的结果
For every even integerN , denote byD(N) andD1,2(N) the number of representations of N as a sum of two primes and as a sum of a prime and an integer having at most two prime factors, respectively. In this paper, we give a new upper bound for D(N) and a new lower bound for D1,2(N), which improve the corresponding results of Chen. We also obtain similar results for the twin prime problem