ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let n≥0n\geq 0 and let kk be integers, and let b0,b1,…,bn∈Qb_0,b_1,\ldots,b_n\in\mathbb{Q}. Suppose that

(kp−1p−1)≡∑j=0nbjpjH({1}j;p−1)(modp2n+2){kp-1\choose p-1}\equiv \sum_{j=0}^n b_jp^jH(\{1\}^j;p-1)\pmod{p^{2n+2}}

for all sufficiently large primes pp.

Uniqueness conjecture. Then bj=bj,n(k)b_j=b_{j,n}(k) for j=0,1,…,nj=0,1,\ldots,n.

The conjecture asserts that the coefficients in this family of congruences are uniquely determined. In the special case n=k=1n=k=1, it would imply that infinitely many primes have numerator of the Bernoulli number Bp−3B_{p-3} not divisible by pp, an unresolved problem.

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.