Adding up to Powers
The authors give an elegant combinatorial proof of the remarkable Moessner's process which generates the well-known procedure of obtaining the squares by adding the odd numbers: \(1+3+\ldots+(2n-1)=n^2\). Start with the sequence \(1,2,3,\ldots\). For given \(k\), at \(j\)-th stage \((j<k)\) delete every \((k+1-j)\)-th member of the current sequence and construct the sequence of partial sums of the surviving sequence. Then the \((k-1)\)-th stage leaves the sequence of \(k\)-th powers. The authors then discuss generalizations of this process obtained by widening the choice of deletion rules. A different generalization was earlier discussed by \textit{C. T. Long} [Am. Math. Mon. 73, 846--851 (1966; Zbl 0148.02003)].
This page was built for publication: Adding up to Powers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3982583)