ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For positive integers nn and rr, let

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.

Small-index multiplier conjecture. Set

a3=3, a5=15, a7=21, a9=15, a11=33, a13=1365, a15=3,a_3=3,\ a_5=15,\ a_7=21,\ a_9=15,\ a_{11}=33,\ a_{13}=1365,\ a_{15}=3,

and

b2=12, b3=4, b4=60, b5=20, b6=84, b7=28, b8=60, b9=20, b10=132, b11=44, b12=5460.b_2=12,\ b_3=4,\ b_4=60,\ b_5=20,\ b_6=84,\ b_7=28,\ b_8=60,\ b_9=20,\ b_{10}=132,\ b_{11}=44,\ b_{12}=5460.

Then the congruences

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}

hold for the corresponding listed indices. This is a numerical proposal for particular multipliers, following the general multiplier conjecture; the supplied text does not establish these congruences.

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.