A short proof of a sum of powers formula

DOI10.1080/00029890.2018.1460977MaRDI QIDQ4577971zbMATH OpenOpenAlexDBLPWikidataFDO

Authors 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

Mathematics Subject Classification ID

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

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; zbMATH DE number 5298097
• Combinatorial proofs of formulas for power sums
• A short proof of Stirling's formula

Cites work

• A Combinatorial Approach to Sums of Integer Powers

Cited in

(8)

• More Trees and Power Sums
• A Short Proof of a Concrete Sum
• A combinatorial view of sums of powers
• A Probabilistic Approach to The Moments of Binomial Random Variables and Application
• A combinatorial identity of subset-sum powers in rings.
• Two classical formulas for the sum of powers of consecutive integers via complex analysis
• Computing Sums of Powers of Integers with the Hockey-Stick Identity and the Stirling Numbers
• Sum of Squares of Consecutive Integers: A Proof Using 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)