Monthly Archives: July 2014

A Combinatorial Proof for the Power Sum

Probably the most common formula for the power sum is the one involving binomial coefficients and Bernoulli numbers , sometimes called Faulhaber’s formula: Historically, this, or a variant of it, was the first general formula for the power sum. There … Continue reading

Posted in binomial coefficients, combinatorics, number theory, Stirling numbers | Leave a comment