exponential sums over primes;
circle method;
prime;
D O I:
10.1007/s10114-008-6089-4
中图分类号:
O29 [应用数学];
学科分类号:
070104 ;
摘要:
In this paper, we prove that each sufficiently large integer N not equivalent to 1 (mod 3) can be written as N = p + p(1)(2) + p(2)(2) + p(3)(2) + p(4)(2), with [GRAPHICS] where U = N9/20+epsilon and p, p(j) are primes.
机构:
North China Univ Water Resources & Elect Power, Sch Math & Stat, Zhengzhou 450046, Henan, Peoples R ChinaNorth China Univ Water Resources & Elect Power, Sch Math & Stat, Zhengzhou 450046, Henan, Peoples R China