ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let nn be a positive integer and let Bn−1B_{n-1} denote the (n−1)(n-1)-st Bernoulli number. Agoh–Giuga conjecture. The integer nn is prime if and only if

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

This conjecture characterizes the prime numbers through a congruence involving Bernoulli numbers; the source gives no resolution status.

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.