Proofs of power sum and binomial coefficient congruences via Pascal's identity

DOI10.4169/AMER.MATH.MONTHLY.118.06.549zbMATH Open1230.05014DBLPjournals/tamm/MacMillanS11arXiv1011.0076OpenAlexW2962834903WikidataQ30048149 ScholiaQ30048149MaRDI QIDQ3012020FDOQ3012020

Authors: Kieren MacMillan, Jonathan Sondow 

Publication date: 30 June 2011

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

Abstract: A frequently cited theorem says that for n > 0 and prime p, the sum of the first p n-th powers is congruent to -1 modulo p if p-1 divides n, and to 0 otherwise. We survey the main ingredients in several known proofs. Then we give an elementary proof, using an identity for power sums proven by Pascal in 1654. An application is a simple proof of a congruence for certain sums of binomial coefficients, due to Hermite and Bachmann.

Full work available at URL: https://arxiv.org/abs/1011.0076

Recommendations

• scientific article; zbMATH DE number 5274256
• Some binomial coefficient congruences
• A note on the congruences with sums of powers of binomial coefficients
• Sums of powers of consecutive integers and Pascal's triangle
• On sums of binomial coefficients modulo \(p^2\)

zbMATH Keywords

congruence for power sumscongruence for sums of binomial coefficients

Mathematics Subject Classification ID

Factorials, binomial coefficients, combinatorial functions (05A10) Combinatorial identities, bijective combinatorics (05A19) Congruences; primitive roots; residue systems (11A07) Binomial coefficients; factorials; (q)-identities (11B65)

Cited In (9)

• Solutions of the congruence \(1+2^{f(n)}+\ldots +n^{f(n)}\equiv 0 \pmod n\)
• A reformulation technique to solve polynomial optimization problems with separable objective functions of bounded integer variables
• SUMS OF POWERS WITH Fk NUMBERS
• Combinatorial Proofs of Pascal's Formula for Sums of Powers of the Integers
• The Zagier modification of Bernoulli numbers and a polynomial extension. I
• Power-sum denominators
• Moser's mathemagical work on the equation \(1^k+2^k+\ldots+(m-1)^k=m^k\)
• Polynomial extension of Fleck's congruence
• On binomial coefficients modulo squares of primes

This page was built for publication: Proofs of power sum and binomial coefficient congruences via Pascal's identity

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