ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For positive integers nn and rr, define

Sn(r)=∑k=0n(nk)2(2kk)(2k+1)r.S_n^{(r)}=\sum_{k=0}^{n}{n\choose k}^2{2k\choose k}(2k+1)^r.

Multiplier conjecture. There exist integers a2r−1a_{2r-1} and brb_r, independent of nn, such that

a2r−1∑k=0n−1Sk(2r−1)≡0(modn2),a_{2r-1}\sum_{k=0}^{n-1}S_k^{(2r-1)}\equiv0\pmod{n^2},

and

br∑k=0n−1kSk(r)≡0(modn2).b_r\sum_{k=0}^{n-1}kS_k^{(r)}\equiv0\pmod{n^2}.

The conjecture asks for universal, nn-independent multipliers; the source notes that determining their best possible values is difficult and gives no resolution of the general 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.