ProbXiv
Explorersign in
Problem archiveProblem record

Statement

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.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.