科研之友
微信
新浪微博
Facebook
分享链接
摘要
Let P-r denote an almost-prime with at most r prime factors, counted according to multiplicity. In this paper, it is proved that for each integer k with 4 <= k <= 5, and for every sufficiently large even integer N satisfying the congruence condition N not equivalent to 2 (mod 3) for k = 4, the equation N = x(2) + p(1)(2) + p(2)(3) + p(3)(4) + p(4)(4) + p(5)(k) is solvable with x being an almost-prime P-r and the other variables primes, where r = 6 for k = 4, and r = 9 for k = 5. This result constitutes an improvement upon that of R.C. Vaughan.
- 出版日期2014-12
- 单位同济大学
