Waring's problem for sixteenth powers

被引:0
|
作者
李红泽
机构
[1] China
[2] Jinan 250100
[3] Shandong University
[4] Department of Mathematics
基金
中国国家自然科学基金;
关键词
Waring’s problem; iterative method; estimation of exponential sum;
D O I
暂无
中图分类号
O152 [群论];
学科分类号
070104 ;
摘要
Let G (k) denote the smallest s such that every sufficiently large natural number is the sum of at most s fcth powers of natural numbers. It is proved that G (16)<111. This improves the result of T. D. Wooley’s.
引用
收藏
页码:56 / 64
页数:9
相关论文
共 50 条