Finiteness conjecture for power-sum congruence solutions

About 10 years old · traced to

Let m∈Nm\in\mathbb{N}, and let Sn(n)=∑i=1ninS_n(n)=\sum_{i=1}^{n}i^n. The solutions are the natural numbers nn satisfying

Sn(n)≡m(modn).S_n(n)\equiv m\pmod{n}.

Finiteness conjecture. For every m∈Nm\in\mathbb{N}, the set of solutions to the congruence

Sn(n)≡m(modn)S_n(n)\equiv m\pmod{n}

is finite.

The conjecture is proposed as a natural extension of the paper's results for prime mm; the authors state that new ideas are needed to handle the general composite case, and no resolution is given.

References

Primary source

Max Alekseyev, Jose Maria Grau and Amtonio Oller-Marcen, “Computing solutions to the congruence 1^n + 2^n + + n^np n”, arXiv:1602.02407 (2018).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.