Every integer is a sum or difference of 28 integral eighth powers (Q1096663)

Let v(k) be the least s such that every integer is the sum of s elements of the form \(\pm z^ k\), where z is an integer. Finding bounds for v(k) is sometimes called the ``easier'' Waring problem. \textit{W. H. J. Fuchs} and \textit{E. M. Wright} [Q. J. Math., Oxf. Ser. 10, 190-209 (1939; Zbl 0022.11501)] had shown that 16\(\leq v(8)\leq 30\). It is now proved that 17\(\leq v(8)\leq 28\) and, more generally, that \(2^{n+1}+1\leq v(2^ n)\) for any integer \(n\geq 2\).