Abstract
We establish a new family of q-supercongruences modulo the fourth power of a cyclotomic polynomial, and give several related results. Our main ingredients are q-microscoping and the Chinese remainder theorem for polynomials.
Similar content being viewed by others
Avoid common mistakes on your manuscript.
1 Introduction
More than one hundred years ago, Ramanujan mysteriously recorded a list of rapidly convergent series of \(1/\pi \) (see [1, p. 352]), including
which he later published in [19, Equation (40)]. In 1997, Van Hamme [23] observed that 13 Ramanujan’s and Ramanujan-type formulas possess interesting p-adic analogues, such as
where \(p>3\) is a prime and \((a)_n=a(a+1)\cdots (a+n-1)\) is the Pochhammer symbol. Van Hamme [23, (C.2)] himself proved (1.2) and two of the other supercongruences of his list. The supercongruence (1.2) was later proved to be true modulo \(p^4\) by Long [17]. For more Ramanujan-type supercongruences, we refer the reader to Zudilin’s paper [26].
During the past few years, q-analogues of congruences and supercongruences have been investigated by many authors (see [3,4,5,6,7,8,9,10,11,12,13,14,15,16, 18, 21, 22, 24, 25, 27]). For instance, using a method similar to that used in [26], the first author and Wang [12, Theorem 1.2] gave a q-analogue of (1.2): for odd n,
Moreover, the first author and Zudilin [13] devised a method of ‘creative microscoping’ to prove that, for any positive integer n with \(\gcd (n,6)=1\),
where \((\frac{-3}{\cdot })\) is the Jacobi symbol, see [13, Theorem 1.1, Equation (6)]. Here it is appropriate to recall the standard q-hypergeometric notation: \((a;q)_n=(1-a)(1-aq)\cdots (1-aq^{n-1})\) is the q-shifted factorial, with the condensed notation \((a_1,\dots ,a_m;q)_n=(a_1;q)_n\cdots (a_m;q)_n\) for products of q-shifted factorials; \([n]=[n]_q=(1-q^n)/(1-q)\) is the q-integer; and \(\Phi _n(q)\) stands for the nth cyclotomic polynomial in q:
where \(\zeta _n\) denotes an nth primitive root of unity.
Clearly, the q-supercongruence (1.4) is a q-analogue of the following result (see [20, Conjecture 5.6]):
which is a p-adic analogue of (1.1). This means that by letting \(q\rightarrow 1\) in (1.4) one obtains (1.5). We point out that no other proofs of (1.5) are known up to now.
The first author and Zudilin [13, Theorem 4.2] also gave a two-parameter generalization of (1.3) as follows: for odd n, modulo \([n](1-aq^n)(a-q^n)\),
where \(m=(n-1)/2\) or \((n-1)\). Recently, based on the above q-congruence, by applying the Chinese remainder theorem for coprime polynomials, the first author [6, Theorem 1.1] succeeded in giving a full parametric generalization of (1.3): modulo \([n]\Phi _n(q)(1-aq^n)(a-q^n)\),
where \(m=(n-1)/2\) or \((n-1)\). Moreover, the present authors [8, Theorem 1.1, Equation (2a)] showed that, for odd \(n>1\),
The main purpose of this paper is to establish a new family of q-supercongruences modulo the fourth power of a cyclotomic polynomial, which may somewhat be deemed a generalization of (1.3) and (1.7) modulo \([n]\Phi _n(q)^3\).
Theorem 1.1
Let d, n, r be integers satisfying \(d\geqslant 2\), \(r\leqslant d-2\) (in particular, r may be negative), and \(n\geqslant d-r\), such that d and r are coprime, and \(n\equiv -r\pmod {d}\). Then
where \(M=(dn-n-r)/d\) or \(n-1\).
The proof is given in Sect. 3.
It is easy to see that the q-factorial \((q^{2r};q^d)_{(dn-n-r)/d}\) in (1.8) contains the factor \(1-q^{(d-2)n}\) for \(d\geqslant 3\). Since \(1-q^{(d-2)n}\equiv [dn-n]\equiv 0\pmod {\Phi _n(q)}\) and \((q^d;q^d)_{(dn-n-r)/d}\) is coprime with \(\Phi _n(q)\), we conclude from Theorem 1.1 that
for \(d\geqslant 3\). Our proof of Theorem 1.1 implies that the above q-congruence is further true modulo \([n]\Phi _n(q)\). Or the reader may check that the denominator of the reduced form of the fraction \((q^{2r};q^d)_{(dn-n-r)/d}/(q^d;q^d)_{(dn-n-r)/d}\) is coprime with [n].
We should point out that the present authors [10] have given a different generalization of (1.3) and (1.7) modulo \(\Phi _n(q)^4\) as follows: for \(d\geqslant 3\) and n, r satisfying the same condition as in Theorem 1.1, we have
For \(d\geqslant 3\) and \(r=\pm 1\), Theorem 1.1 can be stated as follows:
Corollary 1.2
Let d and n be positive integers with \(d\geqslant 3\) and \(n\equiv -1\pmod {d}\). Then
where \(M=(dn-n-1)/d\) or \(n-1\).
Corollary 1.3
Let d and n be positive integers with \(d\geqslant 3\) and \(n\equiv 1\pmod {d}\). Then
where \(M=(dn-n+1)/d\) or \(n-1\).
We shall also prove the following q-congruence, which was originally conjectured by the first author and Zudilin [13, Conjecture 5.2].
Theorem 1.4
Let d and n be positive integers with \(d\geqslant 3\) and \(n\equiv -1\pmod {d}\). Then
Note that the \(a=1\) case of (1.10) modulo \(\Phi _n(q)^2\) has already been proved by the present authors [11, Theorem 2.4].
2 Some Lemmas
We first give the following result which is a generalization of [11, Lemma 3.1], [10, Lemma 3] and [24, (2.1)].
Lemma 2.1
Let d, m and n be positive integers with \(m\leqslant n-1\). Let r be an integer satisfying \(dm\equiv -r\pmod {n}\). Then, for \(0\leqslant k\leqslant m\), we have
Proof
In view of \(q^{dm+r}\equiv q^n\equiv 1\pmod {\Phi _n(q)}\), we have
Furthermore, modulo \(\Phi _n(q)\), we get
which together with (2.1) establishes the assertion. \(\square \)
Lemma 2.2
Let d, n be positive integers with \(\gcd (d,n)=1\). Let r be an integer and let a, b be indeterminates. Then
where \(0\leqslant m\leqslant n-1\) and \(dm\equiv -r\pmod {n}\).
Proof
It is clear that Lemma 2.2 is true for \(n=1\) or \(r=0\). We now assume that \(n>1\) and \(r\ne 0\). By Lemma 2.1 (which is clearly also true for \(m=0\)) one sees that, for \(0\leqslant k\leqslant m\), the kth and \((m-k)\)th terms on the left-hand side of (2.2) cancel each other modulo \(\Phi _n(q)\), i.e.,
This proves that the q-congruence (2.2) holds modulo \(\Phi _n(q)\).
Moreover, since \(dm\equiv -r\pmod {n}\), the expression \((q^r;q^d)_k\) contains a factor of the form \(1-q^{\alpha n}\) for \(m< k\leqslant n-1\), and is therefore congruent to 0 modulo \(\Phi _n(q)\). At the same time the expression \((q^d;q^d)_k\) is relatively prime to \(\Phi _n(q)\) for \(m< k\leqslant n-1\). Therefore, each summand in (2.3) with k in the range \(m< k\leqslant n-1\) is congruent to 0 modulo \(\Phi _n(q)\). This together with (2.2) modulo \(\Phi _n(q)\) establishes the q-congruence (2.3) modulo \(\Phi _n(q)\).
We are now able to prove (2.2) and (2.3) modulo [n]. Let \(\zeta \ne 1\) be an nth root of unity, not necessarily primitive. Namely, \(\zeta \) is a primitive root of unity of degree s with \(s\mid n\) and \(s>1\). Let \(c_q(k)\) denote the kth term on the left-hand side of (2.3), i.e.,
The q-congruences (2.2) and (2.3) modulo \(\Phi _n(q)\) with \(n\mapsto s\) imply that
where \(dm_1\equiv -r\pmod {s}\) and \(0\leqslant m_1\leqslant s-1\). We have
It follows that
and
This means that the sums \(\sum _{k=0}^{n-1}c_q(k)\) and \(\sum _{k=0}^{m}c_q(k)\) are both divisible by the cyclotomic polynomial \(\Phi _s(q)\). Since this is true for any divisor \(s>1\) of n, we deduce that they are divisible by
thus establishing the q-congruences (2.2) and (2.3). \(\square \)
We now give the following result, which is a generalization of [13, Theorem 4.2].
Lemma 2.3
Let d, n, r be integers satisfying \(d\geqslant 2\) and \(n\geqslant d-r\), such that d and r are coprime, and \(n\equiv -r\pmod {d}\). Let a, b be indeterminates. Then, modulo \([n](1-aq^{dn-n})(a-q^{dn-n})\),
where \(M=(dn-n-r)/d\) or \(n-1\).
Proof
By the condition in the lemma, we have \(r\ne 0\). Recall that Jackson’s \({}_6\phi _5\) summation formula can be written as
(see [2, Appendix (II.21)]). Letting \(q\mapsto q^d\), \(a=q^r\), \(b\mapsto q^r/b\), \(c=q^{dn-n+r}\) and \(N=(dn-n-r)/d\) in (2.7), we obtain
Namely, when \(a=q^{dn-n}\) or \(a=q^{n-dn}\) the two sides of (2.6) are equal. Thus, the q-congruence (2.6) holds modulo \((1-aq^{dn-n})(a-q^{dn-n})\).
On the other hand, by Lemma 2.2, we see that the left-hand side of (2.6) is congruent to 0 modulo [n]. Since \([dn-n]\) is also congruent to 0 modulo [n] and \((bq^d;q^d)_{(dn-n-r)/d}\) is coprime with [n], we conclude that (2.6) also holds modulo [n]. The proof then follows from the fact that \((1-aq^{dn-n})(a-q^{dn-n})\) and [n] are coprime polynomials.
Note that the condition \(n\geqslant d-r\) means that \((dn-n-r)/d\leqslant n-1\), which is used in the identity (2.8) for \(M=n-1\). \(\square \)
Lemma 2.4
Let d, n, r be integers satisfying \(d\geqslant 2\) and \(n\geqslant d-r\), such that d and r are coprime, and \(n\equiv -r\pmod {d}\). Let a, b be indeterminates. Then
where \(M=(dn-n-r)/d\) or \(n-1\).
Proof
Letting \(q\mapsto q^d\) and taking \(a=q^r\), \(b=aq^r\), \(c=q^r/a\) and \(N=(dn-n-r)/d\) in (2.7), we obtain
Namely, when \(b=q^{dn-n}\) both sides of (2.9) are equal. This proves the desired q-congruence. \(\square \)
3 Proof of Theorems 1.1 and 1.4
With the help of Lemmas 2.3 and 2.4, we can prove the main theorems in this paper now. We need to establish the following parametric generalization of Theorem 1.1.
Theorem 3.1
Let d, n, r be integers satisfying \(d\geqslant 2\), \(r\leqslant d-2\), and \(n\geqslant d-r\), such that d and r are coprime, and \(n\equiv -r\pmod {d}\). Let a be an indeterminate. Then, modulo \([n]\Phi _n(q)(1-aq^{dn-n})(a-q^{dn-n})\),
where \(M=(dn-n-r)/d\) or \(n-1\).
Proof
It is clear that the polynomials \([n](1-aq^{dn-n})(a-q^{dn-n})\) and \(b-q^{dn-n}\) are coprime. By the Chinese remainder theorem for coprime polynomials, we can determine the remainder of the left-hand side of (2.6) modulo \([n](1-aq^{dn-n})(a-q^{dn-n})(b-q^{dn-n})\) from (2.6) and (2.9). To this end, we require the following q-congruences:
Thus, from (2.6) and (2.9) we deduce that, modulo \([n](1-aq^{dn-n})(a-q^{dn-n})(b-q^{dn-n})\),
Note that \(1-q^{dn-n}\) has the factor \(\Phi _n(q)\) and so do \((q^{2r};q^d)_{(dn-n-r)/d}\) and \((q^{d-r};q^d)_{(dn-n-r)/d}\) since they contain the factors \(1-q^{(d-2)n}\) and \(1-q^n\), respectively (we need to check that \(2r+2n\leqslant dn\), which is guaranteed by the condition \(r\leqslant d-2\) and \(n\geqslant d-r\) in the theorem). Moreover, the factor \((bq^d;q^d)_{M}\) in the denominator of the left-hand side of (3.2) is coprime with \(\Phi _n(q)\) when \(b=1\). Thus, letting \(b=1\) in (3.2) and observing that
we see that the right-hand of (3.2) reduces to
modulo \({\Phi _n(q)^2(1-aq^{dn-n})(a-q^{dn-n})}\), thus establishing Eq. (3.1) modulo \(\Phi _n(q)^2(1-aq^{dn-n})(a-q^{dn-n})\). On the other hand, the q-congruences (2.2) (\(m=(dn-n-r)/d\) in this case) and (2.3) are also true for \(b=1\). That is, the q-congruence (3.1) holds modulo [n]. The proof then follows from the fact that the least common multiple of \(\Phi _n(q)^2(1-aq^{dn-n})(a-q^{dn-n})\) and [n] is just \([n]\Phi _n(q)(1-aq^{dn-n})(a-q^{dn-n})\). \(\square \)
Proof of Theorem 1.1
Since \((1-q^{dn-n})^2\) contains the factor \(\Phi _n(q)^2\) and \((q^d;q^d)_M\) is coprime with \(\Phi _n(q)\), letting \(a=1\) in (3.1), we are led to
By Lemma 2.2, the above q-congruence is true modulo [n] and is therefore also true modulo \([n]\Phi _n(q)^3\). Further, if \(d=2\) then by the condition in the theorem, one sees that \(r<0\) and \(-r<(n-r)/2\) and so \((q^{2r};q^2)_{(n-r)/2}\) vanishes. This completes the proof. \(\square \)
Proof of Theorem 1.4
Let \(d\geqslant 3\) and take \(r=1\) and \(M=n-1\) in (3.1). Noticing that \((q^2;q^d)_{(dn-n-1)/d}\) is congruent to 0 modulo \(\Phi _n(q)\) (we have mentioned this before) and \((q^d;q^d)_{(dn-n-1)/d}\) is coprime with \(\Phi _n(q)\), we see that (1.10) holds modulo \(\Phi _n(q)^2\). By Lemma 2.2, it also holds modulo [n]. This proves the theorem. \(\square \)
4 Concluding Remarks
Using Lemma 2.1, we may also prove the following result similar to Lemma 2.2.
Lemma 4.1
Let d, n be positive integers with \(\gcd (d,n)=1\). Let r be an integer. Then
where \(0\leqslant m\leqslant n-1\) and \(dm\equiv -r\pmod {n}\).
Thus, the q-congruence (1.9) (i.e., [10, Theorem 1]) can be further strengthened as follows.
Theorem 4.2
Let d, n, r be integers satisfying \(d\geqslant 3\), \(r\leqslant d-2\), and \(n\geqslant d-r\), such that d and r are coprime, and \(n\equiv -r\pmod {d}\). Then
where \(M=(dn-n-r)/d\) or \(n-1\).
Similarly to the proof of Lemma 2.3, we can also prove the following generalization of [13, Theorem 4.2].
Theorem 4.3
Let d and n be positive integers with \(n\equiv 1\pmod {d}\). Then, modulo \([n](1-aq^n)(a-q^n)\),
where \(m=(n-1)/d\) or \(n-1\).
Moreover, using the Chinese remainder theorem for coprime polynomials, we may prove that, for such n and d, modulo \([n](1-aq^n)(a-q^n)(b-q^n)\),
For \(d=1\), the q-congruence (4.2) is just an identity (with a telescoping truncated sum). For \(d=2\), letting \(b=1\) in (4.3), we get (1.6), which further reduces to (1.3) when \(m=(n-1)/2\) and a tends to 1. This is what the first author obtained in [6]. For \(d\geqslant 3\), we are unable to deduce, by first letting \(b=1\) and then taking \(a\rightarrow 1\), a concrete interesting q-congruence modulo \(\Phi _n(q)^4\) from (4.3) (because there appears to be no simple formula for the limit).
We conclude our paper with the following two conjectural q-supercongruences related to Theorem 3.1. (In the following conjectures, we actually consider the difference of the sums in (3.1), determined by the two endpoints \(M=n-1\), and \(M=(dn-n-r)/d\). We observed that this difference has a factor, as specified in Conjectures 4.4 and 4.5.) In the case \(d=2\) and \(r=1\) they coincide and were recently confirmed by the first author [6, Theorem 6.1].
Conjecture 4.4
Let d, n be positive integers and r a (possibly negative) integer with \(dn-n\geqslant r\geqslant d-n\), such that d and r are coprime, and \(n\equiv -r\pmod d\). Then, modulo \([n]\Phi _n(q)(1-aq^{dn-n})(a-q^{dn-n})(b-q^{dn-n})\),
Conjecture 4.5
Let d, n be positive integers and r a (possibly negative) integer with \(n\geqslant r\geqslant n-dn+d\), such that d and r are coprime, and \(n\equiv r\pmod d\). Then, modulo \([n]\Phi _n(q)(1-aq^n)(a-q^n)(b-q^n)\),
References
Berndt, B.C.: Ramanujan’s Notebooks, Part IV. Springer, New York (1994)
Gasper, G., Rahman, M.: Encyclopedia of Mathematics and Its Applications. Basic Hypergeometric Series, vol. 96, 2nd edn. Cambridge University Press, Cambridge (2004)
Gorodetsky, O.: \(q\)-Congruences, with applications to supercongruences and the cyclic sieving phenomenon. Int. J. Number Theory 15, 1919–1968 (2019)
Guo, V.J.W.: A \(q\)-analogue of the (A.2) supercongruence of Van Hamme for primes \(p\equiv 1~(\text{ mod }~ 4)\). Rev. R. Acad. Cienc. Exactas Fís. Nat. Ser. A Mat. 114, 123 (2020)
Guo, V.J.W.: \(q\)-Analogues of Dwork-type supercongruences. J. Math. Anal. Appl. 487, 124022 (2020)
Guo, V.J.W.: \(q\)-Supercongruences modulo the fourth power of a cyclotomic polynomial via creative microscoping. Adv. Appl. Math. 120, 102078 (2020)
Guo, V.J.W.: A further \(q\)-analogue of Van Hamme’s (H.2) supercongruence for primes \(p\equiv 3~(\text{ mod }~ 4)\). Int. J. Number Theory (to appear)
Guo, V.J.W., Schlosser, M.J.: Proof of a basic hypergeometric supercongruence modulo the fifth power of a cyclotomic polynomial. J. Differ. Equ. Appl. 25, 921–929 (2019)
Guo, V.J.W., Schlosser, M.J.: Some new \(q\)-congruences for truncated basic hypergeometric series: even powers. Results Math. 75, 1 (2020)
Guo, V.J.W., Schlosser, M.J.: A family of \(q\)-hypergeometric congruences modulo the fourth power of a cyclotomic polynomial. Israel J. Math. (to appear)
Guo, V.J.W., Schlosser, M.J.: Some \(q\)-supercongruences from transformation formulas for basic hypergeometric series. Constr. Approx. (to appear)
Guo, V.J.W., Wang, S.-D.: Some congruences involving fourth powers of central \(q\)-binomial coefficients. Proc. R. Soc. Edinb. Sect. A 150, 1127–1138 (2020)
Guo, V.J.W., Zudilin, W.: A \(q\)-microscope for supercongruences. Adv. Math. 346, 329–358 (2019)
Guo, V.J.W., Zudilin, W.: A common \(q\)-analogue of two supercongruences. Results Math. 75, 46 (2020)
Liu, J.-C.: On a congruence involving \(q\)-Catalan numbers. C. R. Math. Acad. Sci. Paris 358, 211–215 (2020)
Liu, J.-C., Petrov, F.: Congruences on sums of \(q\)-binomial coefficients. Adv. Appl. Math. 116, 102003 (2020)
Long, L.: Hypergeometric evaluation identities and supercongruences. Pac. J. Math. 249, 405–418 (2011)
Ni, H.-X., Pan, H.: Some symmetric \(q\)-congruences modulo the square of a cyclotomic polynomial. J. Math. Anal. Appl. 481, 123372 (2020)
Ramanujan, S.: Modular equations and approximations to \(\pi \). Quart. J. Math. Oxford Ser. (2) 45, 350–372 (1914)
Sun, Z.-W.: Super congruences and Euler numbers. Sci. China Math. 54, 2509–2535 (2011)
Straub, A.: Supercongruences for polynomial analogs of the Apéry numbers. Proc. Am. Math. Soc. 147, 1023–1036 (2019)
Tauraso, R.: Some \(q\)-analogs of congruences for central binomial sums. Colloq. Math. 133, 133–143 (2013)
Van Hamme, L.: Some conjectures concerning partial sums of generalized hypergeometric series. In: \(p\)-Adic Functional Analysis (Nijmegen, 1996). Lecture Notes in Pure and Applied Mathematics, vol. 192, pp. 223–236. Dekker, New York (1997)
Wang, X., Yue, M.: A \(q\)-analogue of the (A.2) supercongruence of Van Hamme for any prime \(p\equiv 3~(\text{ mod } ~ 4)\). Int. J. Number Theory 16, 1325–1335 (2020)
Wang, X., Yue, M.: Some \(q\)-supercongruences from Watson’s \(_8\phi _7\) transformation formula. Results Math. 75, 71 (2020)
Zudilin, W.: Ramanujan-type supercongruences. J. Number Theory 129, 1848–1857 (2009)
Zudilin, W.: Congruences for \(q\)-binomial coefficients. Ann. Combin. 23, 1123–1135 (2019)
Funding
Open access funding provided by Austrian Science Fund (FWF).
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Victor J. W. Guo was partially supported by the National Natural Science Foundation of China (Grant 11771175). Michael J. Schlosser was partially supported by FWF Austrian Science Fund Grant P32305.
Rights and permissions
Open Access This article is licensed under a Creative Commons Attribution 4.0 International License, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons licence, and indicate if changes were made. The images or other third party material in this article are included in the article’s Creative Commons licence, unless indicated otherwise in a credit line to the material. If material is not included in the article’s Creative Commons licence and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. To view a copy of this licence, visit http://creativecommons.org/licenses/by/4.0/.
About this article
Cite this article
Guo, V.J.W., Schlosser, M.J. A New Family of q-Supercongruences Modulo the Fourth Power of a Cyclotomic Polynomial. Results Math 75, 155 (2020). https://doi.org/10.1007/s00025-020-01272-7
Received:
Accepted:
Published:
DOI: https://doi.org/10.1007/s00025-020-01272-7