ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let p>3p>3 be a prime, and define

Hk−1(2)=∑j=1k−11j2,Hp−1(1)=∑j=1p−11j,H_{k-1}(2)=\sum_{j=1}^{k-1}\frac{1}{j^2},\qquad H_{p-1}(1)=\sum_{j=1}^{p-1}\frac{1}{j},

with Bp−5B_{p-5} the Bernoulli number of index p−5p-5. Equivalent form of Sun's conjecture.

∑k=1p−1Hk−1(2)k2(2kk)≡Hp−1(1)3p3+26135pBp−5(modp2).\sum_{k=1}^{p-1}\frac{H_{k-1}(2)}{k^2\binom{2k}{k}}\equiv \frac{H_{p-1}(1)}{3p^3}+\frac{26}{135}pB_{p-5} \pmod{p^2}.

The paper states that this congruence is equivalent, via its preceding theorem, to the first congruence in Sun's conjecture. It is therefore not a separate conjecture, but an equivalent formulation of the same open claim.

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.