ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let N+\mathbb{N}^+ denote the positive integers, and for integers i≥0i\geq 0 and n≥1n\geq 1 define

ai(n)=∑k=0⌊(n−i)/3⌋(−1)n−k(3k+ik)(2k+ik)(n3k+i)(n+kk)3n−3k−i.a_i(n)=\sum_{k=0}^{\lfloor(n-i)/3\rfloor}(-1)^{n-k}\binom{3k+i}{k}\binom{2k+i}{k}\binom{n}{3k+i}\binom{n+k}{k}3^{n-3k-i}.

Let pp be a prime satisfying p>2ip>2i. The higher Almkvist-Zudilin supercongruence. For n,i∈N+n,i\in\mathbb{N}^+,

ai(pn)≡p3(−1)i−1a1(pn)i2(2i−1i−1)≡p3(−1)i−1p2(n+22)a1(n)i2(2i−1i−1).a_i(pn)\equiv_{p^3}(-1)^{i-1}\frac{a_1(pn)}{i^2\binom{2i-1}{i-1}}\equiv_{p^3}\frac{(-1)^{i-1}p^2\binom{n+2}{2}a_1(n)}{i^2\binom{2i-1}{i-1}}.

This extends the paper's congruence program from a0(n)a_0(n) to the sequences ai(n)a_i(n) with positive index. The supplied context gives proof outlines only for the case i=1i=1 and says that the remaining cases are left to the reader, so the general assertion remains open in the source.

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.