A Combinatorial View of Sums of Powers

摘要

We give a combinatorial interpretation of the sum of powers of the first n positive integers. Then we use this interpreation to give combinatorial proofs of two formulas for the power sum: one featuring the Stirling numbers of the second kind and one featuring the Eulerian numbers. As a consequence of the latter, we present a combinatorial proof of Worpitzky's identity.