A Combinatorial Approach to Sums of Integer Powers

DOI10.2307/2691490MaRDI QIDQ2721369zbMATH OpenOpenAlexFDO

Authors George MacKiw

Publication date 3 June 2002

Published in Mathematics Magazine (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2307/2691490

zbMATH Keywords

polynomialsums of integer powers

Mathematics Subject Classification ID

Factorials, binomial coefficients, combinatorial functions (05A10) Elementary number theory (11A99)

Cited in

(11)

• Finding sum of powers on arithmetic progressions with application of Cauchy's equation
• A Combinatorial Approach to Sums of Two Squares and Related Problems
• Combinatorial Proofs of Pascal's Formula for Sums of Powers of the Integers
• scientific article; zbMATH DE number 3693352 (Why is no real title available?)
• A short proof of a sum of powers formula
• CURLICUES WITH MEMORY
• Generalizations of number-theoretic sums
• A combinatorial view of sums of powers
• A Probabilistic Approach to The Moments of Binomial Random Variables and Application
• Two classical formulas for the sum of powers of consecutive integers via complex analysis
• Sum of Squares of Consecutive Integers: A Proof Using Complex Analysis

This page was built for publication: A Combinatorial Approach to Sums of Integer Powers

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