Waring–Goldbach problem: two squares and some unlike powers
Waring–Goldbach problem: two squares and some unlike powers
复制标题
DOI：
10.1007/s10474-014-0472-7
复制
发表时间：
2015-02
影响因子：
0.9
通讯作者：
Y. Cai;Q. Mu
中科院分区：
文献类型：
--
作者：
Y. Cai;Q. Mu
令Pr表示一个几乎素的最大素因子，根据重数计数。本文证明了对于任意大的奇整数N，当x为几乎素数P6，其它项为素数的幂时，方程可解.这一结果是对C.胡利[7]。
LetPrdenote an almost-prime with at mostrprime factors, counted according to multiplicity. In this paper it is proved that for every sufficiently large odd integerN, the equationis solvable withxbeing an almost-primeP6and the other terms powers of primes. This result constitutes a refinement upon that of C. Hooley [7].