@article{Vavilov_2022, title={Computers as novel mathematical reality: V. Easier Waring problem}, url={http://cte.eltech.ru/ojs/index.php/kio/article/view/1756}, DOI={10.32603/2071-2340-2022-3-5-63}, abstractNote={<p>In this part I continue the discussion of the role of computers in the current research on the additive number theory, in particular in the solution of the <em>easier</em> Waring problem. This problem consists in finding for each natural <em>k</em> the smallest such <em>s</em> =<em>v</em>(<em>k</em>) that all natural numbers <em>n</em> can be written as sums of <em>s</em> integer <em>k</em>-th powers <em>n</em> = <em>± x<sub>1</sub><sup>k</sup> ± ... ± x<sub>s</sub><sup>k</sup></em> <em>with signs</em>. This problem turned out to be much harder than the original Waring problem. It is intimately related with many other problems of arithmetic and diophantine geometry. In this part I discuss various aspects of this problem, and several further related problems, such as the rational Waring problem, and Waring problems for finite fields, other number rings, and polynomials, with special emphasys on connection with polynomial identities and the role of computers in their solution. As of today, these problems are quite far from being fully solved, and provide extremely broad terrain both for the use in education, and amateur computer assisted exploration.</p>}, number={3}, journal={Computer Tools in Education}, author={Vavilov, Nikolai}, year={2022}, month={Nov.}, pages={5-63} }