Some picturesque generalizations of Nechaev-Waring's problem obtained by means of cognitive interactive computer graphics
The author extends the consideration of pythograms applied to number- theoretic problems [see the review above] to Nechaev's problem of representing natural numbers \(n\geq 1\) by sums of summands of the form \(x(x+1)\cdots(x+n-1)/n!\), where \(x\geq 0\). If \(x\geq m\) \((m\geq 0)\), this problem is called a generalized Nechaev-Waring problem. The author states some results estimating the number of such representations; these results were arrived at using the pythograms. Such proofs as are given are not too convincing. The English is terrible.
- Waring's problem from the standpoint of the cognitive interactive computer graphics
- scientific article; zbMATH DE number 1670625
- Cognitive visualization of some integer-valued polynomials
- scientific article; zbMATH DE number 2219891
- On Generalized Nehari Problems
- scientific article; zbMATH DE number 2087990
- Prolegomena to a cognitive investigation of Euclidean diagrammatic reasoning
- scientific article; zbMATH DE number 4133549
- Generalization of the Hilbert-Waring theorem
- scientific article; zbMATH DE number 4133549 (Why is no real title available?)
- scientific article; zbMATH DE number 3082671 (Why is no real title available?)
- On the question of representing natural numbers by a sum of terms of the form x(x+1) (x+n-1)/n!
- Some extensions of Pall's theorem
- Some picturesque generalizations of Nechaev-Waring's problem obtained by means of cognitive interactive computer graphics
- Waring's problem from the standpoint of the cognitive interactive computer graphics
This page was built for publication: Some picturesque generalizations of Nechaev-Waring's problem obtained by means of cognitive interactive computer graphics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1174653)