Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
134 tokens/sec
GPT-4o
9 tokens/sec
Gemini 2.5 Pro Pro
47 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Faulhaber's Formula, Odd Bernoulli Numbers, and the Method of Partial Sums (2106.14607v4)

Published 25 May 2021 in math.GM

Abstract: Let ``Faulhaber's formula'' refer to an expression for the sum of powers of integers written with terms in n(n+1)/2. Initially, the author used Faulhaber's formula to explain why odd Bernoulli numbers are equal to zero. Next, Cereceda gave alternate proofs of that result and then proved the converse, if odd Bernoulli numbers are equal to zero then we can derive Faulhaber's formula. Here, the original author will give a new proof of the converse using the method of partial sums and mathematical induction.

Summary

We haven't generated a summary for this paper yet.