1 Introduction
For any complex variable x, define the shifted-factorial by
and let $\Gamma _{p}(x)$ denote the p-adic Gamma function. Throughout the paper, p denotes an odd prime. In 1997, Van Hamme [Reference Van Hamme, Schikhof, Perez-Garcia and Kakol9, (H.2)] proved that
In 2016, Long and Ramakrishna [Reference Long and Ramakrishna6] gave an extension of (1.1):
In the same year, Deines et al. [Reference Deines, Fuselier, Long, Swisher, Tu and Lauter1] discovered the nice supercongruence: for $p\equiv {1}\pmod {6}$ ,
Several years later, Mao and Pan [Reference Mao and Pan7] (see also Sun [Reference Sun8, Theorem 1.3]) found a result similar to (1.1): for $p\equiv 1\pmod {4}$ ,
For any complex numbers x and q, define the q-shifted factorial by
For simplicity, we also adopt the compact notation
where $m\in \mathbb {Z}^{+}$ and $n\in \mathbb {Z}^{+}\cup \{0,\infty \}.$ Let $[n]=(1-q^n)/(1-q)$ be the q-integer and let $\Phi _n(q)$ stand for the nth cyclotomic polynomial in q:
where $\zeta $ is a primitive nth root of unity. Recently, Wei [Reference Wei11] and Wang [Reference Wang10] established q-analogues of (1.2) for the first case: if $n\equiv 1\pmod 4$ , then modulo $\Phi _n(q)^3$ ,
Guo and Zudilin [Reference Guo and Zudilin5] and Guo [Reference Guo3] gave q-analogues of (1.2) for the second case: if $n\equiv 3\pmod 4$ , then
Guo and Zudilin [Reference Guo and Zudilin5] also found the q-supercongruence: for any positive integer $n>1$ with $n\equiv 1\pmod 4$ ,
Setting $n=p$ and then letting $q\to 1$ in (1.5), they obtain the extension of (1.3): for $p\equiv 1\pmod 4$ ,
Motivated by the results just mentioned, we shall establish the following theorem.
Theorem 1.1. Let $n, d$ be positive integers such that $n-dn+2d\leq r\leq n+d$ , $\gcd (n, d) = 1$ and $n\equiv r\pmod {2d}$ . Then
Obviously, the $d=2, r=3$ case of Theorem 1.1 is exactly (1.4). When $d=2, r=1$ , Theorem 1.1 reduces to (1.5). Taking $n=p$ and then letting $q\to 1$ in Theorem 1.1 gives the following supercongruence.
Proposition 1.2. Let p be an odd prime and let d be a positive integer such that $p-dp+2d\leq r\leq p+d$ and $p\equiv r\pmod {2d}$ . Then
Specialising the parameters d and r, Proposition 1.2 can produce many concrete supercongruences. Six of these are given in the following corollaries.
Corollary 1.3. Let p be a prime with $p\equiv 1\pmod {6}$ . Then
Proof. Take $d=3, r=1$ in Proposition 1.2.
Corollary 1.4. Let p be a prime with $p\equiv 5\pmod {6}$ . Then
Proof. Take $d=3, r=5$ in Proposition 1.2.
Corollary 1.5. Let p be a prime with $p\equiv 1\pmod {8}$ . Then
Proof. Take $d=4, r=1$ in Proposition 1.2.
Corollary 1.6. Let p be a prime with $p\equiv 3\pmod {8}$ . Then
Proof. Take $d=4, r=3$ in Proposition 1.2.
Corollary 1.7. Let p be a prime with $p\equiv 5\pmod {8}$ . Then
Proof. Take $d=4, r=5$ in Proposition 1.2.
Corollary 1.8. Let p be a prime with $p\equiv 7\pmod {8}$ . Then
Proof. Take $d=4, r=7$ in Proposition 1.2.
We shall prove Theorem 1.1 in the next section by means of the creative microscoping method recently introduced by Guo and Zudilin [Reference Guo and Zudilin4].
2 Proof of Theorem 1.1
Following Gasper and Rahman [Reference Gasper and Rahman2], define the basic hypergeometric series by
To prove Theorem 1.1, we require the q-Dixon formula:
where $|qa^{{1}/{2}}/bc|<1$ .
Proof of Theorem 1.1.
Setting $a=q^{-1-2n}$ in (2.1), we obtain
Performing the simultaneous replacements $n\mapsto (n-r)/2d$ , $q\mapsto q^{2d}$ , $b\mapsto bq^{2r-2d}$ , $c\mapsto q^{2r-2d}/b$ in the above identity, we get
This gives the following congruence: modulo $(a^2-q^{2n})$ ,
However, taking $c=q^{-1-2n}$ in (2.1), we obtain
Employing the substitutions $n\mapsto (n-r)/2d$ , $q\mapsto q^{2d}$ , $a\mapsto q^{2r-2d}/a^2$ , $b\mapsto q^{2r-2d+2n}$ , we arrive at
This gives the following congruence: modulo $(b-q^{2n})(1-bq^{2n})$ ,
Note that the right-hand side of (2.2) can also be written as that of (2.3), since $(q^{2r}/a^2,aq^{3r-3d};q^{2d})_{(n-r+d)/d}$ contains the factor $a^2-q^{2n}$ . It is clear that the polynomials $(a^2-q^{2n})$ and $(b-q^{2n})(1-bq^{2n})$ are relatively prime. Therefore, from (2.2) and (2.3) we deduce that, modulo $(a^2-q^{2n})(b-q^{2n})(1-bq^{2n})$ ,
Letting $a {\kern2pt\to\kern2pt} 1$ , $b{\kern2pt\to\kern2pt} 1$ in (2.4), we are led to the q-supercongruence in Theorem 1.1.
3 Two open problems
Numerical calculations indicate the following two open problems related to Corollaries 1.3 and 1.5.
Conjecture 3.1. Let p be a prime with $p\equiv 1\pmod {6}$ and let s be a positive integer. Then
Conjecture 3.2. Let p be a prime with $p\equiv 1\pmod {8}$ and let s be a positive integer. Then
Acknowledgement
The author is grateful to the reviewer for a careful reading and valuable comments.