检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:Meng Zaizhao, Department of Mathematics Peking University Beijing 100871 China
出 处:《Acta Mathematica Sinica,English Series》1996年第3期262-267,共6页数学学报(英文版)
摘 要:Let G(k) denote the smallest number s such that every sufficiently large natural number is the sum of, at most, s k-th powers of natural numbers. In this paper, we give new bounds for G(12), G(13) and G(19).Let G(k) denote the smallest number s such that every sufficiently large natural number is the sum of, at most, s k-th powers of natural numbers. In this paper, we give new bounds for G(12), G(13) and G(19).
关 键 词:Waring’s problom Circle method Iterative method DIFFERENCE
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.229