# Proofs of Power Sum and Binomial Coefficient Congruences Via Pascal's Identity

```@article{MacMillan2011ProofsOP,
title={Proofs of Power Sum and Binomial Coefficient Congruences Via Pascal's Identity},
author={Kieren MacMillan and J. Sondow},
journal={The American Mathematical Monthly},
year={2011},
volume={118},
pages={549 - 551}
}```
• Published 2011
• Mathematics, Computer Science
• The American Mathematical Monthly
Abstract A well-known and frequently cited congruence for power sums is where n ≥ 1 and p is prime. 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.
24 Citations

#### Topics from this paper

A Proof of Symmetry of the Power Sum Polynomials Using a Novel Bernoulli Number Identity
• Mathematics, Computer Science
• J. Integer Seq.
• 2017
An elementary proof that the sum of p-th powers of the first natural numbers can be expressed as a polynomial in n of degree \$p+1\$ is given and a novel identity involving Bernoulli numbers is proved. Expand
An Explicit Identity to solve sums of Powers of Complex Functions
A recurrence relations for sums of powers of complex functions can be written as a system of linear equation AX=B. Using properties of determinant and Cramer's rule for solving systems of linearExpand
Power-Sum Denominators
• Mathematics
• 2017
Abstract The power sum 1n + 2n +… + xn has been of interest to mathematicians since classical times. Johann Faulhaber, Jacob Bernoulli, and others who followed expressed power sums as polynomials inExpand
Reducing the Erdős–Moser Equation 1 n + 2 n + ⋯ + kn = (k + 1) n Modulo k and k 2
• Mathematics, Computer Science
• Integers
• 2011
Reducing the equation modulo k and k 2, it is given necessary and sufficient conditions on solutions to the resulting congruence and supercongruence to prove the conjecture that the only solution of the Diophantine equation is the trivial solution 1 + 2 = 3. Expand
On a Congruence Modulo n 3 Involving Two Consecutive Sums of Powers
• Mathematics
• 2014
For various positive integers k, the sums of kth powers of the first n positive integers, Sk(n) := 1 k +2 k +···+n k , are some of the most popular sums in all of mathematics. In this note we prove aExpand
Smallest common denominators for the homogeneous components of the Baker-Campbell-Hausdorff series
In a recent paper the author derived a formula for calculating common denominators for the homogeneous components of the Baker–Campbell-Hausdorff (BCH) series. In the present work it is proved thatExpand
Smallest common denominators for the homogeneous components of the Baker-Campbell-Hausdorff series
In a recent paper the author derived a formula for calculating common denominators for the homogeneous components of the Baker-Campbell-Hausdorff (BCH) series. In the present work it is proved thatExpand
A congruence modulo \$n^3\$ involving two consecutive sums of powers and its applications
For various positive integers k, the sums of kth powers of the first n positive integers, Sk(n+ 1) = 1 k + 2 + · · ·+ n, have got to be some of the most popular sums in all of mathematics. In thisExpand
Another Power Identity Involving Binomial Theorem and Faulhaber's Formula
In this paper, we derive and prove another odd power identity, by means of Binomial theorem and Faulhaber's formula.
Solutions of the congruence 1+2f(n)+⋯+nf(n)≡0 mod n
• Mathematics
• 2015
In this paper we characterize, in terms of the prime divisors of n, the pairs for which n divides . As an application, we derive some results on the sets for some choices of f.