Some picturesque generalizations of Nechaev-Waring's problem obtained by means of cognitive interactive computer graphics (Q1174653): Difference between revisions

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.