ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let (x)k(x)_k denote the rising factorial, with (x)0=1(x)_0=1. Let d⩾2d\geqslant 2 be an even integer, and let p≡d+1(mod2d)p\equiv d+1\pmod{2d} be a prime. The hypergeometric supercongruence.

∑k=0p−1(3dk+1)(1d)k2(d−1d)k(12d)kk!34k(d+22d)k≡0(modp3).\sum_{k=0}^{p-1} (3dk+1)\frac{(\frac{1}{d})_{k}^{2}(\frac{d-1}{d})_{k}(\frac{1}{2d})_{k}} {k!^{3}4^{k} (\frac{d+2}{2d})_{k}} \equiv 0 \pmod {p^3}.

This is proposed as a variation of an earlier supercongruence obtained by extending the summation range to p−1p-1; its validity is supported by numerical calculation, but no proof is supplied here.

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.