Answers are grounded in this paper and cite their sources.
In this part I discuss the role of computers in the current research on the additive number theory, in particular in the solution of the classical Waring problem. In its original XVIII century form this problem consisted in finding for each natural k the smallest such s=g(k) that all natural numbers n can be written as sums of s non-negative k-th powers, n=x_1^k+ldots+x_s^k. In the XIX century the problem was modified as the quest of finding such minimal $s=G(k)$ that almost all n can be expressed in this form. In the XX century this problem was further specified, as for finding such G(k) and the precise list of exceptions. The XIX century problem is still unsolved even or cubes. However, even the solution of the original Waring problem was [almost] finalised only in 1984, with heavy use of computers. In the present paper we document the history of this classical problem itself and its solution, as also discuss possibilities of using this and surrounding material in education, and some further related aspects.
No takes yet. Share an insight, caveat, or question.
N. A. Vavilov (2020) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: