ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let pp be an odd prime, and let mm and rr be positive integers with p∤mp\nmid m and m∤rm\nmid r. Let ⟨−r/m⟩p\langle -r/m\rangle_p denote the least nonnegative residue of −r/m-r/m modulo pp, and let [p]=1+q+⋯+qp−1[p]=1+q+\cdots+q^{p-1}. Exponent recurrence conjecture. There exists a unique integer fp,m,rf_{p,m,r} such that

∑k=0p−1(qr;qm)k(qm−r;qm)kxk(qm;qm)k2≡(−1)⟨−rm⟩pqfp,m,r∑k=0p−1(qr;qm)k(qm−r;qm)k(x;qm)kqmk(qm;qm)k2(mod[p]2),\sum_{k=0}^{p-1}\frac{(q^r;q^m)_k(q^{m-r};q^m)_k x^k}{(q^m;q^m)_k^2} \equiv (-1)^{\langle -\frac{r}{m}\rangle_p}q^{f_{p,m,r}} \sum_{k=0}^{p-1}\frac{(q^r;q^m)_k(q^{m-r};q^m)_k(x;q^m)_kq^{mk}}{(q^m;q^m)_k^2}\pmod{[p]^2},

and these integers satisfy

fp,m,m+r={−fp,m,r,r≡0(modp),fp,m,r−r,otherwise.f_{p,m,m+r}=\begin{cases}-f_{p,m,r},&r\equiv0\pmod p,\\ f_{p,m,r}-r,&\text{otherwise.}\end{cases}

This is one of two stronger conjectural results for the paper's preceding theorems. The supplied text gives numerical values but 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.