2000 character limit reached
On Waring's problem in sums of three cubes for smaller powers
Published 27 Oct 2020 in math.NT | (2010.14559v1)
Abstract: We give an upper bound for the minimum $s$ with the property that every sufficiently large integer can be represented as the sum of $s$ positive $k$-th powers of integers represented as the sum of three positive cubes for the cases $2\leq k\leq 4.$
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.