A short proof of a sum of powers formula

DOI10.1080/00029890.2018.1460977zbMATH Open1392.05009DBLPjournals/tamm/Trevino18OpenAlexW2885672736WikidataQ58165684 ScholiaQ58165684MaRDI QIDQ4577971FDOQ4577971

Enrique Treviño

Publication date: 6 August 2018

Published in: The American Mathematical Monthly (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00029890.2018.1460977

Recommendations

• A short proof for the sum formula and its generalization
• A simple proof of the sum formula
• A Quick Route to Sums of Powers
• A Short Proof of a Concrete Sum
• scientific article
• Combinatorial proofs of formulas for power sums
• A short proof of Stirling's formula

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Factorials, binomial coefficients, combinatorial functions (05A10) Farey sequences; the sequences (1^k, 2^k, dots) (11B57)

Cites Work

• A Combinatorial Approach to Sums of Integer Powers

Cited In (7)

• Computing Sums of Powers of Integers with the Hockey-Stick Identity and the Stirling Numbers
• A Probabilistic Approach to The Moments of Binomial Random Variables and Application
• A Combinatorial View of Sums of Powers
• More Trees and Power Sums
• A combinatorial identity of subset-sum powers in rings.
• A Short Proof of a Concrete Sum
• Two classical formulas for the sum of powers of consecutive integers via complex analysis

This page was built for publication: A short proof of a sum of powers formula

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4577971)