检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:Sanying SHI Li LIU
机构地区:[1]School of Mathematics, Hefei University of Technology
出 处:《Chinese Annals of Mathematics,Series B》2018年第6期1033-1046,共14页数学年刊(B辑英文版)
基 金:supported by the National Natural Science Foundation of China(No.11201107);the China Scholarship Council
摘 要:Let Pr denote an almost prime with at most r prime factors, counted according to multiplicity. In the present paper, it is proved that for any sufficiently large even integer n, the equation n=x^3+p1^3+p2^3+p3^3+p4^3+p1^3+p5^3+p6^3+p7^3 has solutions in primes pi with x being a P6. This result constitutes a refinement upon that of Hooley C.
关 键 词:Waring-Goldbach problem Hardy-Littlewood method Sieve theory
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:18.225.34.193