2000 character limit reached
On Waring's problem for larger powers
Published 18 Nov 2022 in math.NT | (2211.10380v1)
Abstract: Let $G(k)$ denote the least number $s$ having the property that every sufficiently large natural number is the sum of at most $s$ positive integral $k$-th powers. Then for all $k\in \mathbb N$, one has [ G(k)\le \lceil k(\log k+4.20032)\rceil . ] Our new methods improve on all bounds available hitherto when $k\ge 14$.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.