On supercongruences for truncated sums of squares of basic hypergeometric series (Q829697): Difference between revisions

This short note discusses supercongruences for truncated sums of squares of basic hypergeometric series, generalizing results of \textit{V. J. W. Guo} and \textit{W. Zudilin} [Adv. Math. 346, 329--358 (2019; Zbl 1464.11028)]. For a complex number \(q\) and a complex variable \(a\), the \(q\)-shifted factorials are defined by \((a:q)_0=1, (a:q)_n=\prod_{i=0}^{n-1}(1-aq^i)\) and \((a:q)_{\infty}=\prod_{i=0}^{\infty}(1-aq^i),\,|q|<1\). For any nonnegative integer \(n\), the \(q\)-integer is given by \([n]_q=[n]=(1-q^n)/(1-q)=1+q+\cdots+q^{n-1}\). The \(n\)-th cyclotomic polynomial in \(\mathbb{Z}[[q]]\) is given by \(\Phi_n(q)=\prod_{j=1}^n (q-\zeta^j)\) where \(\zeta=e^{2\pi i/n}\) is the \(n\)-th root of unity, and the product runs over \(j\) such that \(\mathrm{gcd}(j,n)=1\). Some sample results are formulated in the following theorems. Theorem 1: Let \(C_q(k)\) be the \(k\)-th term of \[\sum_{n=0}^{\infty}(-1)^k\frac{(q:q^2)_k(-q:-q^2)^2_k}{(q^4:q^4)_k(-q^4:q^4)^2_k}[6k+1]q^{3k^2}\] and let \[a_q(k)=\sum_{j=0}^k c_q(j)c_q(k-j).\] Then for any positive odd integer \(n\), \[\sum_{k=0}^{n-1} a_q(k)\equiv 0\pmod{[n]}).\] Letting \(q\to 1\), for any odd prime \(p\), \[\sum_{k=0}^{p-1}\frac{(-1)^k}{8^k}\sum_{j=0}^k\binom {2j}j\binom{2k-2j}{k-j} (6j+1)(6k-6j+1)\equiv 0\pmod p.\] Theorem 2: Let \(C_q(k)\) be the \(k\)-th term of \[\sum_{k=0}^{\infty}\frac{(aq:q^2)_k(q/a:q^2)_k(q:q^2)_{2k}}{(aq^6:q^6)_k(q^6/a:q^6)_k(q^2:q^2)_{2k}}(8k+1)q^{2k^2}\] and let \[a_q(k)=\sum_{j=0}^k c_q(j)c_q(k-j).\] Then for any positive odd integer coprime to \(6\), \[\sum_{k=0}^{n-1}a_q(k)\equiv q^{-(n-1)}[n]^2\pmod{[n]\Phi_n(q)^2}.\] Letting \(a\to 1\), let \(c_q(k)\) be the \(k\)-th term of \[\sum_{k=0}^{\infty}\frac{(q:q^2)_k^2(q:q^2)_{2k}}{(q^6:q^6)^2_k(q^2:q^2)_{2k}}[8k+1]q^{2k^2}\] and \[a_q(k) =\sum_{j=0}^k c_q(j)c_q(k-j).\] Then for any positive odd integer coprime to \(6\), \[\sum_{k=0}^{n-1} a_q(k)\equiv q^{-(n-1)}[n]^2\pmod{[n]\Phi_n(q)^2}.\] As a corollary, for any prime \(p>3\), \[\sum_{k=0}^{p-1}\frac{1}{2^{8k}3^{2k}}\sum_{j=0}^k \binom {2j}j^2\binom{4j}{2j}\binom{2k-2j}{k-j}^2 \binom{4k-4j}{2k-2j}(8j+1)(8k-8j+1)\equiv p^2\pmod{p^3}.\] Proofs are computational.