Waring's problem from the standpoint of the cognitive interactive computer graphics (Q1174652)

Let \(\Delta=[n',n'']\) be some interval on the natural numbers \(\mathbb{N}\) and consider a \(K\times L\) table of cells filled by elements of \(\Delta\) according to the prescription \(n_{ij}=(n'-1)+(i-1)L+j\). To each cell in the table associate a color by choosing one color if a certain number- theoretic predicate \(P(n_{ij})\) is true and another color if \(P(n_{ij})\) is false. Thus the color of cells simulates additive properties of elements of \(\Delta\) and the location in the table simulates multiplicative properties. These objects are called ``pythograms''. The author applies such simulations to recover known results on Waring's problem and generalizations of it, as well as to suggest further results not yet obtainable by traditional methods (such as general estimates for \(G(m,r)=\text{Arg} \min_ s\{| N(m,r,s)|<\infty\}\), where \(N(m,r,s)=\{n\geq s\cdot m^ r+1:n\neq\sum^ s_{i=1}n^ r_ i\), \(n_ i\geq m\}\). The English is not clear, and the proofs are not entirely convincing.