Waring-Goldbach problem: Two squares and some higher powers
详细信息    查看全文
文摘
Let Pr denote an almost-prime with at most r prime factors, counted according to multiplicity. In this paper it is proved that for every large odd integer N  , and 5≤a≤8, a≤b, View the MathML source, the equation
View the MathML source
is solvable with x   being an almost-prime Pr(a,b) and the other variables primes, where r(a,b) is defined in the Theorem, in particular, r(6,7)=5. This result constitutes an refinement upon that of J. Brűdern.

© 2004-2018 中国地质图书馆版权所有 京ICP备05064691号 京公网安备11010802017129号

地址:北京市海淀区学院路29号 邮编:100083

电话:办公室:(+86 10)66554848;文献借阅、咨询服务、科技查新:66554700