A simple recursive representation of the Faulhaber series
Abstract
We present a simple elementary recursive representation of the so called Faulhaber series Σk=1n kN for integer n and N, without reference to Bernoulli numbers or polynomials.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.