ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let pp be an odd prime, and let mm and rr be positive integers with r<mr<m and p≡±1(modm)p\equiv\pm1\pmod m. Let fp,m,rf_{p,m,r} be the unique integer from the exponent recurrence conjecture. Explicit exponent formula.

fp,m,r=r(m−r)(1−p2)2m.f_{p,m,r}=\frac{r(m-r)(1-p^2)}{2m}.

The formula gives an explicit value for the exponent appearing in the stronger q-supercongruence conjecture under the stated congruence condition on pp. The supplied text gives no proof or resolution.

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.