A simple mnemonic to compute sums of powers
Alessandro Mariani

TL;DR
The paper introduces a simple recursive method for computing sums of powers of natural numbers, avoiding complex constants like Bernoulli numbers, making it accessible for educational and competitive contexts.
Contribution
It presents a novel, easy-to-remember recursive formula for sums of powers that does not require advanced constants, simplifying calculations especially in educational settings.
Findings
Provides a recursive formula for sums of powers
Eliminates need for Bernoulli numbers in calculations
Suitable for use in mathematics competitions
Abstract
We give a simple recursive formula to obtain the general sum of the first natural numbers to the th power. Our method allows one to obtain the general formula for the th power once one knows the general formula for the th power. The method is very simple to remember owing to an analogy with differentiation and integration. Unlike previously known methods, no knowledge of additional specific constants (such as the Bernoulli numbers) is needed. This makes it particularly suitable for applications in cases when one cannot consult external references, for example mathematics competitions.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAlgorithms and Data Compression · Numerical Methods and Algorithms · Mathematics and Applications
