Papers
Topics
Authors
Recent
Search
2000 character limit reached

Congruences of Power Sums

Published 20 Dec 2017 in math.NT | (1801.01542v1)

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.

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.