Euler-Maclaurin formula Created 2026-10-20 Updated 2026-11-05
The Euler-Maclaurin formula relates a finite sum to an integral and endpoint derivatives. If are integers, and has continuous derivatives through order on , thenHere are Bernoulli numbers. With the periodic Bernoulli function, the exact remainder isThis form rearranges the last endpoint correction in the NIST statement.[ref]
For on and , the remainder vanishes because the second Bernoulli polynomial has integral zero over each unit interval. The result is , the square pyramidal number formula. For other functions, retaining or bounding makes the finite truncation a controlled approximation.
Square pyramidal number Created 2026-10-20 Updated 2026-11-05
The th square pyramidal number counts a square-based stack with layers containing objects:For example, . To prove the formula, let . Direct algebra gives and , so mathematical induction identifies with the sum of squares.
Differences give sums over consecutive square numbers. The leading term shows cubic growth of the total, even though the largest layer has only objects.