Computers as novel mathematical reality: V. Easier Waring problem
Journal: Computer Tools in Education
Year: 2022

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 easier Waring problem. This problem consists in finding for each natural k the smallest such s =v(k) that all natural numbers n can be written as sums of s integer k-th powers n = ± x1k ± ... ± xsk with signs. This problem turned out to be much harder than the original Waring problem. It is intimately related with many other problems of arith