ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let the Bernoulli numbers Bk∈QB_k \in \mathbb{Q} be defined by

tet−1=∑k≥0Bktkk!.\frac{t}{e^{t}-1}=\sum_{k\ge 0}B_{k}\frac{t^{k}}{k!}.

For an integer p>1p>1 the rational number pBp−1pB_{p-1} has denominator prime to pp, so the congruence pBp−1≡−1(modp)pB_{p-1}\equiv -1 \pmod p is meaningful, meaning that the numerator of pBp−1+1pB_{p-1}+1 written in lowest terms is divisible by pp.

For every integer p>1p>1,

p is prime  ⟺  pBp−1≡−1(modp),p \text{ is prime} \iff pB_{p-1}\equiv -1 \pmod{p},

and equivalently, for every integer p>1p>1,

p is prime  ⟺  ∑i=1p−1i p−1≡−1(modp).p \text{ is prime} \iff \sum_{i=1}^{p-1} i^{\,p-1}\equiv -1 \pmod{p}.

Record

Added
Links

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.