Some picturesque generalizations of Nechaev-Waring's problem obtained by means of cognitive interactive computer graphics
DOI10.1016/0895-7177(90)90061-QzbMath0753.11047OpenAlexW2058203706MaRDI QIDQ1174653
Publication date: 25 June 1992
Published in: Mathematical and Computer Modelling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0895-7177(90)90061-q
simulationsWaring's problemknowledge representationsinteger representationscognitive interactive computer graphicsgeneralized Nechaev-Waring problempythograms
Waring's problem and variants (11P05) Computing methodologies and applications (68U99) General theory of mathematical modeling (00A71) Analytic computations (11Y35)
Related Items (2)
Cites Work
- Generalization of the Hilbert-Waring theorem
- On the question of representing natural numbers by a sum of terms of the form \(x(x+1)\cdots (x+n-1)/n!\)
- Some extensions of Pall's theorem
- Waring's problem from the standpoint of the cognitive interactive computer graphics
- Some picturesque generalizations of Nechaev-Waring's problem obtained by means of cognitive interactive computer graphics
- Unnamed Item
- Unnamed Item
This page was built for publication: Some picturesque generalizations of Nechaev-Waring's problem obtained by means of cognitive interactive computer graphics