ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let p>3p>3 be a prime number. Define the triple sum

Sp=∑k=0p−1∑j=0k∑i=0k−j(2jj)2(4j2j)(2ii)2(4i2i)(2(k−j−i)k−j−i)2(4(k−j−i)2(k−j−i))28k32k(8i+1)(8j+1)(8(k−j−i)+1).S_p= \sum_{k=0}^{p-1} \sum_{j=0}^k \sum_{i=0}^{k-j} \frac{ {2j\choose j}^2{4j\choose 2j} {2i\choose i}^2{4i\choose 2i} {2(k-j-i)\choose k-j-i}^2{4(k-j-i)\choose 2(k-j-i)}}{2^{8k} 3^{2k}} (8i+1)(8j+1) \big(8(k-j-i)+1 \big).

Triple-sum Ramanujan-type congruence. One has

Sp≡0(modp2).S_p\equiv 0 \pmod{p^2}.

This conjecture is motivated by the failure of the corresponding triple sum to satisfy the stronger congruence modulo p3p^3, despite the analogous double-sum congruence modulo p3p^3. It is based on computational evidence, and its general validity remains open.

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.