摘要
证明了每个充分大的奇数N可以表为九个几乎相等的素数的立方之和,即N=p13+…+p93,这里|pj-3N9|U=N13-1918+ε,其中pj(1 j 9)是素数.这一结果与先前在广义黎曼猜想下得到的结果一样强.
Proving that each sufficiently large odd integer N can be written as N=p1^3＋…＋p9^3. with Ipj-3√N/3≤U=N ^1/3-1/198＋e, where Pj are primes. This sharpens Hua＇s result and is as good as what was previously derived from the Generalized Riemann Hypothesis（GRH）.
出处
《山东大学学报（理学版）》
CAS
CSCD
北大核心
2006年第2期59-62,68,共5页
Journal of Shandong University(Natural Science)
基金
数学天元基金资助项目(10526028)
关键词
堆垒素数论
圆法
迭代方法
additive theory of prime numbers
circle method
iterative method
