1 Introduction
In 1880, Appell defined four kinds of double series $F_1$ , $F_2$ , $F_3$ , $F_4$ in two variables (see [Reference Slater13, pages 210–211]) by generalising the Gauss hypergeometric $_{2}F_1$ -series [Reference Gasper and Rahman1, (1.2.1)]. These four series, called Appell series, are famous in the field of double hypergeometric functions and play an important role in mathematical physics.
Based on the definition of the truncated hypergeometric series, Liu [Reference Liu8] introduced the truncated Appell series, defined by
where $(a)_n=a(a+1)\cdots (a+n-1),\ n\in \mathbb {Z}^{+}$ , with $(a)_0=1$ , is the shifted factorial.
Liu [Reference Liu8] confirmed two congruences for $F_1$ and $F_2$ by using some combinatorial identities. Later, Lin and Liu [Reference Lin and Liu7] studied congruence properties of the truncated Appell series $F_3$ and $F_4$ and found the following interesting result: for any odd prime p,
Motivated by the works of Lin and Liu and the recent progress on congruences and q-congruences (see [Reference Guo and Schlosser2–Reference Li and Wang6, Reference Liu and Petrov9–Reference Ni and Pan12, Reference Wei14–Reference Yu and Wang18]), we continue the study of congruence relations for the truncated Appell series. The goal of this paper is to give the following generalisation of (1.1).
Theorem 1.1. Let p be an odd prime. Then
In fact, Theorem 1.1 can be verified by establishing the following more general q-supercongruence, which is the principal goal of this paper. To state the theorem, we need some q-notation. The q-shifted factorial is given by
and the q-binomial coefficients are defined by
Furthermore, $ [n]=[n]_q=(1-q^n)/(1-q)=1+q+\cdots +q^{n-1} $ denotes the q-integer, and $\Phi _n(q)$ stands for the nth cyclotomic polynomial in q, which is given by
with $\zeta $ a primitive nth root of unity.
Theorem 1.2. Let n be a positive odd integer and d an integer and suppose that $n\geq \max \{2d+1,1-2d\}$ . Then, modulo $\Phi _n(q)^4$ ,
where
with $H_k(x)=0$ for any integer $k<1$ .
Clearly, letting $d=0$ , $q \rightarrow 1$ and $n=p$ , an odd prime, in Theorem 1.2, we immediately achieve Theorem 1.1. Additionally, the cases $d=\pm 1$ of Theorem 1.2 yield the following conclusion.
Corollary 1.3. Let $n\geq 3$ be a positive odd integer. Then, modulo $\Phi _n(q)^4$ ,
Setting $n=p$ , an odd prime, and then letting $q\rightarrow 1$ in Corollary 1.3, we instantly arrive at
Numerical calculation indicates that the following generalisation of (1.3) should be true.
Conjecture 1.4. Let p be an odd prime and d an integer with $0<d\leq {(p-1)}/{2}$ . Then
2 Proof of Theorem 1.2
The q-Chu–Vandermonde identity [Reference Gasper and Rahman1, (1.5.2)] can be written as
which is useful in combinatorics and number theory and will play a key role in our proof of Theorem 1.2. Another preliminary result we require is as follows.
Lemma 2.1. Let n be a positive odd integer and d an integer with $n\geq 1-2d$ . Then
Proof. It is routine to verify that
In view of the two simple relations (2.2) and (2.3), we immediately conclude that
where the last step follows from the q-Chu–Vandermonde identity (2.1). This gives the desired result.
Proof of Theorem 1.2. It is not hard to see that
With the help of the above relation, we find that
which implies that, modulo $\Phi _n(q)^4$ ,
However, replacing d by $-d$ in the q-supercongruence (2.4), we easily get
Substituting the q-supercongruences (2.4) and (2.5) into the left-hand side of (1.2) in Theorem 1.2 gives: modulo $\Phi _n(q)^4$ ,
To simplify (2.6), we divide the right-hand side of (2.6) into three parts. Let L stand for the right-hand side of (2.6) and write
where
We first consider the part $L_1$ . Applying the case $q\rightarrow q^2$ of Lemma 2.1, we can simplify $L_1$ by first calculating the terms indexed j as
In fact, changing the summation order of i and j, $L_1$ can also be expressed as
Next, we shall discuss the evaluation of $L_1$ under three cases.
Case (i): $d=0$ . It is easy to check that
which implies (2.7) equals $0$ except for $i=0$ . Thus (2.7) reduces to $(-1)^{(n-1)/2}q^{(1-n^2)/4}$ .
Case (ii): $d\geq 1$ . It is obvious that
which means (2.7) equals $0$ .
Case (iii): $d\leq -1$ . Similarly to case (ii),
It follows that (2.8) equals $0$ .
These considerations show that
At the same time, recalling Lemma 2.1 with $q\rightarrow q^2$ again, we have shown
Likewise, we consider (2.10) in three cases. Following from the assumption that $H_k(x)=0$ for any integer $k<1$ , we thus attain
The detailed proof of (2.11) follows the proof of (2.9) and is omitted here. Now it remains to consider $L_2(-d)$ . Taking $d=-d$ in (2.11),
Substituting the three formulas (2.9), (2.11) and (2.12) into (2.6), we arrive at
The cases $d \geq 1$ and $d \leq -1$ can be compactly combined into
As explained above, this completes the proof of Theorem 1.2.
Acknowledgement
The authors thank the anonymous referee for helpful comments that helped to improve the exposition of this article.