Congruences of Power Sums
Abstract: The following congruence for power sums, $S_n(p)$, is well known and has many applications: $1n+2n +\dots +pn \equiv\begin{cases} -1 \text{ mod } p, & \text{ if } \ p-1 \ | \ n; 0 \text{ mod } p, & \text{ if } \ p-1 \ \not| \ n, \end{cases}$ where $n\in{\mathbb N}$ and $p$ is prime. We extend this congruence, in particular, to the case when $p$ is any power of a prime. We also show that the sequence $(S_n(m) \text{ mod } k )_{m \geq 1}$ is periodic and determine its period.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.