Abstract
In this note, we establish two identities of \((q;\,q)_\infty ^8\) by using Jacobi’s four-square theorem and two of Ramanujan’s identities. As an important consequence, we present one Ramanujan-style proof of the congruence \(p_{-3}(11n+7)\equiv 0\ (\mathrm{mod\ }11)\), where \(p_{-3}(n)\) denotes the number of 3-color partitions of n.
Similar content being viewed by others
Avoid common mistakes on your manuscript.
1 Introduction
A partition of a positive integer n is a nonincreasing sequence of positive integers, called parts, whose sum is n. Let p(n) denote the number of partitions of n. We follow the convention that \(p(0)= 1\). It is well known that the generating function for p(n) satisfies
Throughout this note, we adopt the following notation:
The most famous results for p(n) are the so called Ramanujan’s congruences: for \(n\ge 0\),
Ramanujan [25, Paper 30], Atkin and Swinnerton-Dyer [1], Winquist [26], Garvan [12], Garvan and Stanton [13], Hirschhorn [15–18], and Marivani [22] have given different proofs of the congruence (1.1 1.2 1.3). It is worth mentioning that Winquist [26] found an interesting identity which plays an important role in proving Ramanujan’s congruence modulo 11. In fact, Winquist used his identity to establish an identity for \((q;q)_\infty ^{10}\) from which the congruence (1.1 1.2 1.3) follows easily. Later several proofs of Winquist’s identity are found and new identities for \((q;q)_\infty ^{10}\) are established, see [3, 6, 8–10, 20, 21, 23], for example.
Recently, Hirschhorn [19] presented a most elementary, simple, beautiful proof of the congruence (1.1 1.2 1.3). Later, Gnang and Zeilberger [14] generalized and implemented Hirschhorn’s amazing algorithm for proving Ramanujan-type congruences. They considered \(p_{-a}(n)\), which is defined by
There are many known Ramanujan-type congruences for \(p_{-a}(n)\). Boylan [4] has found all of them for a odd and \({\le }47\). For example,
Every such congruence can be checked by using impressive algorithm of Radu [24]. Although Radu’s algorithm is powerful, it is not elementary. Based on this, Zeilberger said that “it is still interesting (at least to us!) to find a ‘Ramanujan-style,’ or ‘Hirschhorn-style’ proof.”
In this note, we aim to give one “Ramanujan-style” proof of the congruence (1.5). To this end, we will establish two identities for \((q;q)_\infty ^8\) by using Ramanujan’s two identities. Although the series for \((q;q)_\infty ^8\) have been considered by several authors, see [5, 7, 11] for example, our approach is more elementary.
2 Preliminaries
We first introduce two Ramanujan’s theta functions \(\varphi (q)\) and \(\psi (q)\), defined by
Two lemmas related to \(\varphi (q)\) and \(\psi (q)\) are presented as follows.
Lemma 2.1
Proof
See [2, Cor. 1.3.4] for a proof. \(\square \)
Lemma 2.2
Proof
This identity can be derived by using series manipulations, and we omit the details here. \(\square \)
The rest of this section are Jacobi’s four-square theorem and two identities of Ramanujan, which are extremely useful to our later proof.
Lemma 2.3
([Jacobi’s Four-Square Theorem])
Proof
See [2, Thm. 3.3.1] for a proof of (2.5). \(\square \)
Lemma 2.4
Proof
For the proofs of (2.6) and (2.7), see [2, Cor. 1.3.21 and Cor. 1.3.22]. \(\square \)
3 Ramanujan-style proof
We first establish two identities of \((q;q)_\infty ^8\), either of which can be employed to produce the desired Ramanujan-style proof.
Theorem 3.1
Proof
Differentiating both sides of (2.6) with respect to q, we find that
and thus,
Applying (2.6), we have
Differentiating both sides of (2.7) with respect to q, we obtain
and thus
By (2.1 2.2 2.3) and (2.7), we deduce that
From (3.4) and (3.5), we find that
where the last equation follows from the following fact:
Applying (2.5) in (3.6), we conclude that
This completes the proof. \(\square \)
It is interesting to present another identity for \((q;q)_\infty ^8\) which can be derived from (3.1).
Theorem 3.2
Proof
Applying (2.4) with q replaced by \(q^{1/4}\), we arrive at
where the last equation follows from Theorem 3.1. This finishes the proof. \(\square \)
Now we are ready to prove the following theorem by using Theorem 3.1.
Theorem 3.3
For \(n\ge 0\),
Proof
Let us define a(n) to be
Then,
Extracting those terms with powers of the form \(11n + 7\), we conclude that
To prove \(p_{-3}(11n+7)\equiv 0\ (\mathrm{mod\ }11)\), we only need to show that
Consider the congruence equation
which can be rewritten as
Since \(-4\) is a quadratic nonresidue modulo 11, we see that \(3m+1\) is divisible by 11.
Similarly, if we consider the congruence equation \(3m^2+m+n^2+n\equiv 7\ (\mathrm{mod\ }11)\), we can deduce that \(6m+1\) is divisible by 11.
By Theorem 3.1, we see that
which completes the proof. \(\square \)
Remark (3.7) can also be used to prove (3.8), and we leave the details to readers. Multiplying on both sides of (3.1) or (3.7) by \((q;q)_\infty ^2\), and using Ramanujan’s identities (2.6) and (2.7), we obtain a new proof of the following two identities of \((q;q)_\infty ^{10}\) due to Chu [8, Cor. 4.2] and Chan [6, Thm. 3.4]:
References
Atkin, A.O.L., Swinnerton-Dyer, P.: Some properties of partitions. Proc. Lond. Math. Soc. 4, 84–106 (1954)
Berndt, B.C.: Number Theory in the Spirit of Ramanujan. American Mathematical Society, Providence (2006)
Berndt, B.C., Chan, S.H., Liu, Z.-G., Yesilyurt, H.: A new identity for \((q;q)_\infty ^{10}\) with an application to Ramanujan’s partition congruence modulo \(11\). Q. J. Math. 55, 13–30 (2004)
Boylan, M.: Exceptional congruences for powers of the partition functions. Acta Arith. 111, 187–203 (2004)
Cao, Z.: Integer matrix covering systems and product identities for theta functions. Int. Math. Res. Not. 19, 4471–4514 (2011)
Chan, S.H.: Generalized Lambert series identities. Proc. Lond. Math. Soc. 91, 598–622 (2005)
Chan, H.H., Cooper, S., Toh, P.C.: Ramanujan’s Eisenstein series and powers of Dedekind’s eta-function. J. Lond. Math. Soc. 75, 225–242 (2007)
Chu, W.: Theta function identities and Ramanujan’s congruences on the partition function. Q. J. Math. 56, 491–506 (2005)
Chu, W.: Quintuple products and Ramanujan’s partition congruence \(p(11n+ 6)\equiv 0 ({\rm mod } 11)\). Acta Arith. 127, 403–409 (2007)
Chu, W., Yan, Q.: Winquist’s identity and Ramanujan’s partition congruence \(p(11n+ 6)\equiv 0 ({\rm mod } 11)\). Eur. J. Comb. 29, 581–591 (2008)
Cooper, S., Hirschhorn, M.D., Lewis, R.: Powers of Euler’s product and related identities. Ramanujan J. 4, 137–155 (2000)
Garvan, F.G.: New combinatorial interpretations of Ramanujan’s partition congruences mod \(5\), \(7\) and \(11\). Trans. Am. Math. Soc. 305, 47–77 (1988)
Garvan, F.G., Stanton, D.: Sieved partition functions and \(q\)-binomial coefficients. Math. Comput. 55, 299–311 (1990)
Gnang, E., Zeilberger, D.: Generalizing and implementing Michael Hirschhorn’s amazing algorithm for proving Ramanujan-type congruences. arXiv:1306.6668v1
Hirschhorn, M.D.: A generalisation of Winquist’s identity and a conjecture of Ramanujan. J. Indian Math. Soc. 51, 49–55 (1987)
Hirschhorn, M.D.: A birthday present for Ramanujan. Am. Math. Mon. 97, 398–400 (1990)
Hirschhorn, M.D.: Ramanujan’s partition congruences. Discret. Math. 131, 351–355 (1994)
Hirschhorn, M.D.: Winquist and the Atkin–Swinnerton–Dyer partition congruences for modulus \(11\). Australas J. Comb. 22, 101–104 (2000)
Hirschhorn, M.D.: A short and simple proof of Ramanujan’s mod \(11\) partition congruence. J. Number Theory 139, 205–209 (2014)
Kang, S.Y.: A new proof of Winquist’s identity. J. Comb. Theory Ser. A 78, 313–318 (1997)
Kongsiriwong, S., Liu, Z.-G.: Uniform proofs of \(q\)-series-product identities. Results Math. 44, 312–339 (2003)
Marivani, S.: Another elementary proof that \(p(11n+6)\equiv 0 ({\rm mod }11)\). Ramanujan J. 30, 187–191 (2013)
Nupet, C., Kongsiriwong, S.: Two simple proofs of Winquist’s identity. Electron. J. Comb. 17, R116 (2010)
Radu, S.: An algorithmic approach to Ramanujan’s congruences. Ramanujan J. 20, 215–251 (2009)
Ramanujan, S.: Collected Papers. American Mathematical Society, Providence (2000)
Winquist, L.: An elementary proof of \(p(11n+6)\equiv 0 ({\rm mod }11)\). J. Comb. Theory 6, 56–59 (1969)
Author information
Authors and Affiliations
Corresponding author
Additional information
This work was supported by the National Natural Science Foundation of China (No. 11401253).
Rights and permissions
About this article
Cite this article
Lin, B.L.S. Ramanujan-style proof of \(p_{-3}(11n+7) \equiv 0\ (\mathrm{mod\ }11)\) . Ramanujan J 42, 223–231 (2017). https://doi.org/10.1007/s11139-015-9733-5
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11139-015-9733-5