arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2001.02429math.NT
收藏

偶数升幂排列和

Sums of even ascending powers

Chan Ieong Kuan, Didier Lesesvre, Xuanxuan Xiao

摘要:

Freiman和Scourfield证明了任何足够大的整数都可以写成一定数量的偶数次幂的和。我们使用圆的方法来提供这个数字的第一个明确的界限,并表明,任何足够大的整数可以写为133个上升的偶数幂的总和。

英文摘要:

Freiman and Scourfield proved that any large enough integer can be written as a sum of a certain number of ascending even powers. We use the circle method to provide the first explicit bound on this number, and show that any large enough integer can be written as a sum of 133 ascending even powers.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑