Published online by Cambridge University Press: 20 November 2018
Let k ≥ 2 and q = g(k) — G(k), where g(k) is the smallest possible value of r such that every natural number is the sum of at most r k-th powers and G(k) is the minimal value of r such that every sufficiently large integer is the sum of r k-th powers. For each positive integer r ≥ q, let Then for every ε > 0 and N ≥ N(r, ε), we construct a set A of k-th powers such that |A| ≤ (r(2 + ε)r + l)N1/(k+r) and every nonnegative integer n ≤ N is the sum of k-th powers in A. Some related results are also obtained.