ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let BkB_k denote the kk-th Bernoulli number, and let nn be a positive integer.

Agoh's conjecture. The integer nn is prime if and only if

nBn−1≡−1(modn).nB_{n-1}\equiv -1\pmod n.

The source states that this conjecture is equivalent to Giuga's conjecture. Its resolution status is not supplied here.

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.