Next Article in Journal
A Direct Prediction of the Shape Parameter in the Collocation Method of Solving Poisson Equation
Next Article in Special Issue
Generalized Hukuhara Weak Solutions for a Class of Coupled Systems of Fuzzy Fractional Order Partial Differential Equations without Lipschitz Conditions
Previous Article in Journal
A Hybrid Competitive Evolutionary Neural Network Optimization Algorithm for a Regression Problem in Chemical Engineering
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Some Congruences for the Coefficients of Rogers–Ramanujan Type Identities

School of Mathematics, Thapar Institute of Engineering and Technology, Patiala 147004, Punjab, India
*
Author to whom correspondence should be addressed.
Submission received: 7 September 2022 / Revised: 21 September 2022 / Accepted: 25 September 2022 / Published: 1 October 2022

Abstract

:
We examine a few mathematical characteristics of Rogers–Ramanujan type identities as a follow-up work. Recently authors interpreted Rogers–Ramanujan type identities combinatorially using signed color partitions. In the present study, we discovered several congruences for the coefficients of powers of q that are in arithmetic progressions modulo powers of 2 and 3.
MSC:
05A17; 11P83; 11P84; 03E05

1. Introduction

The Rogers–Ramanujan identities (RRI) are the two most well-known q-series identities that have impacted studies in many branches of mathematics and science, and are given as
n = 0 q n 2 ( q ; q ) n = n = 0 ( 1 q 5 n 1 ) 1 ( 1 q 5 n 4 ) 1 ,
n = 0 q n 2 + n ( q ; q ) n = n = 0 ( 1 q 5 n 2 ) 1 ( 1 q 5 n 3 ) 1 .
where
( a ; q ) n = ( 1 a ) ( 1 a q ) ( 1 a q 2 ) ( 1 a q n 1 ) , n 1 ,
( a ; q ) = lim n ( a ; q ) n , | q | < 1 .
These identities were first discovered by Rogers [1] but were appreciated only after Ramanujan rediscovered these sometime before 1913. Despite being over a century old, the Rogers–Ramanujan identities are still the focus of ongoing research. RRI played a major role in algebraic characters [2], partition theory [3], and statistical mechanics [4]. Some of the useful texts on the history of these identities are found in Refs. [3,5,6,7]. These identities are of the form ‘Sum=Product’; therefore, they are sometimes called sum-product identities. MacMahon [8] provided the partition–theoretic interpretations of the RRI given by (1) and (2) as:
Theorem 1.
The number of partitions of n into parts with minimal difference 2 equals the number of partitions of n into parts which are congruent to ± 1 (mod 5).
Theorem 2.
The number of partitions of n with minimal part 2 and minimal difference 2 equals the number of partitions of n into parts which are congruent to ± 2 (mod 5).
Recently, P. Afsharijoo [9] added a new companion to the Rogers–Ramanujan identities. This new companion counts partitions with different types of constraints on even and odd parts. Bailey [10] systematically explored the Rogers–Ramanujan type identities (RRTIs). Additionally, a list of 130 identities of the Rogers–Ramanujan type identities was provided by Slater [11]. Furthermore, Chu and Zhang [12] found many RRTIs using certain transformations. The hard hexagon model in statistical mechanics, a specific instance of a solvable family of hard-square-type models, naturally incorporated many Rogers–Ramanujan type identities. Baxter [13] explained that a number of Rogers–Ramanujan type identities occur in the determination of sub-lattice densities and order parameters. Kedem et al. [14] believed that the Rogers–Ramanujan identities represent the partition function of a physical system with quasiparticles that adhered to specific exclusion statistics. The relationship between RRI and fractional statistics is developed by these exclusion statistics, which are related to fractional statistics. Furthermore, the combinatorial interpretations of many RRTIs were studied using different combinatorial tools, and are available in Refs. [15,16,17,18]. Recently, we have found the combinatorial interpretations of many RRTIs, some of which are listed in Table 1, Table 2 and Table 3, using signed partitions (for signed partitions, readers are referred to Ref. [19]). Additionally, many mathematicians were interested in finding the arithmetic properties of some restricted partition functions [20,21].
The purpose of this paper is to explore the congruences for RRTI, as given in Section 3, Table 1, Table 2 and Table 3. We have arranged 17 Rogers–Ramanujan type identities into three groups: Group 1 contains 10 RRTIs, which are listed in Table 1; Group 2 contains 3 identities, which are listed in Table 2; and Group 3 contains 4 identities, which are listed in Table 3.

2. Preliminaries

We require the following definitions and lemmas to prove the main results in the next section. For | a b | < 1 , Ramanujan’s general theta function f ( a , b ) is defined as
f ( a , b ) = m = a m ( m + 1 ) 2 b m ( m 1 ) 2 .
Using Jacobi’s triple-product identity [22] (entry 19, p. 35), (3) becomes
f ( a , b ) = ( a ; a b ) ( a ; a b ) ( a b ; a b ) .
The special cases of f ( a , b ) are
φ ( q ) = f ( q ; q ) = 1 + 2 m = 1 q m 2 = ( q ; q 2 ) 2 ( q 2 ; q 2 ) = f 2 5 f 1 2 f 4 2 ,
ψ ( q ) = f ( q ; q 3 ) = m = 1 q m ( m + 1 ) 2 = ( q 2 ; q 2 ) ( q ; q 2 ) = f 2 2 f 1 .
In some of the proofs, we also employ Jacobi’s identity from Ref. [23] as Equation (1.7.1):
f 1 3 = n = 0 ( 1 ) n ( 2 n + 1 ) q n ( n + 1 ) / 2 .
Lemma 1.
We have
1 f 1 2 = f 8 5 f 2 5 f 16 2 + 2 q f 4 2 f 16 2 f 2 5 f 8 ,
f 1 2 = f 2 f 8 5 f 4 2 f 16 2 2 q f 2 f 16 2 f 8 ,
1 f 1 4 = f 4 14 f 2 14 f 8 4 + 4 q f 4 2 f 8 4 f 2 10 ,
f 1 4 = f 4 10 f 2 2 f 8 4 4 q f 2 2 f 8 4 f 4 2 ,
1 f 1 f 3 = f 8 2 f 12 5 f 2 2 f 4 f 6 4 f 24 2 + q f 4 5 f 24 2 f 2 4 f 6 2 f 8 2 f 12 ,
f 1 3 f 3 = f 4 3 f 12 3 q f 2 2 f 12 3 f 4 f 6 2 ,
f 3 f 1 3 = f 4 6 f 6 3 f 2 9 f 12 2 + 3 q f 4 2 f 6 f 12 2 f 2 7 ,
f 3 3 f 1 = f 4 3 f 6 2 f 2 2 f 12 + q f 12 3 f 4 ,
f 3 2 f 1 2 = f 4 4 f 6 f 12 2 f 2 5 f 8 f 24 + 2 q f 4 f 6 2 f 8 f 24 f 2 4 f 12 ,
f 3 f 1 = f 4 f 6 f 16 f 24 2 f 2 2 f 8 f 12 f 48 + q f 6 f 8 2 f 48 f 2 2 f 16 f 24 .
Proof. 
Using the two-dissection of φ ( q ) and φ ( q 2 ) from (Ref. [23], Equation (1.9.4) and (1.10.1)), we obtain (8) and (10). On replacing q by q in (5), we obtain (9) and (11). Furthermore, (12), (13), (15), (16), and (17) are Equations (30.12.3), (22.1.13), (22.1.14), (30.10.4), and (30.10.3), respectively, in Ref. [23]. Next, (14) follows from (13) by using q instead of q . □
Lemma 2.
We have
f 4 f 1 = f 12 f 18 4 f 3 3 f 36 2 + q f 6 2 f 9 3 f 36 f 3 4 f 18 2 + 2 q 2 f 6 f 18 f 36 f 3 3 ,
f 1 2 f 2 = f 9 2 f 18 2 q f 3 f 18 2 f 6 f 9 ,
f 2 f 1 2 = f 6 4 f 9 6 f 3 8 f 18 3 + 2 q f 6 3 f 9 3 f 3 7 + 4 q 2 f 6 2 f 18 3 f 3 6 ,
f 1 3 = f 3 c ( q 3 ) 3 q f 9 3 .
where
c ( q ) = m , n = q m 2 + m n + n 2 .
Proof. 
The first identity follows from Equations (33.2.1) and (33.2.5) in Ref. [23]. The second identity is equivalent to the three-dissection of φ ( q ) (see Ref. [23] Equation (14.3.2)). We obtained (20) by replacing q with ω q and ω 2 q and multiplying the two results, where ω is the primitive cube root of unity. □
The three-dissection of ψ ( q ) follows as:
Lemma 3.
We have
ψ ( q ) = f 2 2 f 1 = f 6 f 9 2 f 3 f 18 + q f 18 2 f 9 .
Proof. 
Identity (22) is Equation (14.3.3) of Ref. [23]. □
Lemma 4.
In Ref. [24], for any prime p 5 ,
f 1 = k = ( p 1 ) 2 k ( ± p 1 ) / 6 ( p 1 ) 2 ( 1 ) k q 3 k 2 + k 2 f ( q ( 3 p 2 + ( 6 k + 1 ) p ) 2 , q ( 3 p 2 ( 6 k + 1 ) p ) 2 ) + ( 1 ) ( ± p 1 ) 6 q ( p 2 1 ) 24 f p 2 ,
where
± p 1 6 = ( p 1 ) 6 if   p 1 ( mod 6 ) , ( p 1 ) 6 if   p 1 ( mod 6 ) .
If p 1 2 k p 1 2 and k ± p 1 2 , then 3 k 2 + k 2 p 2 1 24 ( mod p ) .

3. Main Results

In Table 1, Table 2 and Table 3, the sum sides of RRTIs are the generators for the partitions written in the second column, and the product sides of the RRTIs are written in the third column.
  • Group 1
  • We now present 10 RRTIs in this group from Ref. [12] with identity nos. 8, 9, 10, 33, 45, 70, 98, 104, 111, and 112, as shown below.
Table 1. Rogers–Ramanujan type identities.
Table 1. Rogers–Ramanujan type identities.
FunctionSum Side=Product Side
A 1 ( q ) m = 0 ( q ; q ) m + 1 q m ( m + 1 ) 2 ( q ; q ) m = ( q ; q ) ( q ; q ) [ q 4 , q 2 , q 2 ; q 4 ]
A 2 ( q ) m = 0 ( 1 ; q ) 2 m q m ( q ; q ) 2 m = ( q ; q ) ( q ; q ) [ q 4 , q 2 , q 2 ; q 4 ]
A 3 ( q ) m = 0 ( q ; q ) 2 m q m ( q ; q ) 2 m + 1 = ( q ; q ) ( q ; q ) [ q 4 , q 4 , q 4 ; q 4 ]
A 4 ( q ) m = 0 ( q ; q 2 ) m 2 q 2 m 2 ( q 2 ; q 2 ) 2 m = [ q 6 , q 3 , q 3 ; q 6 ] ( q 2 ; q 2 )
A 5 ( q ) m = 0 ( 1 ; q 2 ) m q m ( m + 1 ) ( q ; q ) 2 m = ( q 2 ; q 2 ) ( q 2 ; q 2 ) [ q 6 , q 3 , q 3 ; q 6 ]
A 6 ( q ) m = 0 ( 1 ; q 2 ) m q m ( m + 1 ) 2 ( q ; q ) m ( q ; q 2 ) m = ( q ; q ) ( q ; q ) [ q 8 , q 4 , q 4 ; q 8 ]
A 7 ( q ) m = 0 ( 1 ; q ) m q m ( m + 1 ) 2 ( q ; q 2 ) m ( q ; q ) m = ( q ; q ) ( q ; q ) [ q 10 , q 5 , q 5 ; q 10 ]
A 8 ( q ) m = 0 ( q ; q 2 ) m q m ( m + 1 ) ( q ; q 2 ) 2 m + 1 ( q 2 ; q 2 ) m = [ q 12 , q 4 , q 8 ; q 12 ] ( q ; q )
A 9 ( q ) m = 0 ( q ; q 2 ) m q m ( q ; q ) 2 m + 1 = ( q ; q ) ( q ; q ) [ q 12 , q 3 , q 9 ; q 12 ]
A 10 ( q ) m = 0 ( 1 ; q 2 ) m q m ( q ; q ) 2 m = ( q ; q ) ( q ; q ) [ q 12 , q 6 , q 6 ; q 12 ]
  • Throughout the remainder of this paper, we use
f k = ( q k ; q k ) ,
for positive integer k.
  • From the binomial theorem, we have
f 1 2 k f 2 2 k 1 ( mod 2 k ) .
Before stating the main results, we define
A i ( q ) = m = 0 a i ( m ) q m .
Theorem 3.
For m 0 , we have
a 1 ( 4 m + 2 ) 0 ( mod 2 ) ,
a 1 ( 4 m + 3 ) 0 ( mod 4 ) ,
a 1 ( 8 m + 5 ) 0 ( mod 8 ) ,
a 1 ( 8 m + 6 ) 0 ( mod 4 ) ,
a 1 ( 8 m + 7 ) 0 ( mod 16 ) ,
a 1 ( 16 m + t ) 0 ( mod 4 ) , for t { 10 , 12 }
a 1 ( 32 m + 20 ) 0 ( mod 4 ) ,
a 1 ( 48 m + 34 ) 0 ( mod 4 ) .
Theorem 4.
For m 0 , we have
a 2 ( 4 m + 3 ) 0 ( mod 4 ) ,
a 2 ( 8 m + t ) 0 ( mod 4 ) , for t { 3 , 6 }
a 2 ( 8 m + 7 ) 0 ( mod 8 ) ,
a 2 ( 16 m + 10 ) 0 ( mod 4 ) .
Theorem 5.
For m 0 , we have
a 3 ( 3 m + 2 ) 0 ( mod 2 ) ,
a 3 ( 4 m + 2 ) 0 ( mod 4 ) ,
a 3 ( 4 m + 3 ) 0 ( mod 8 ) ,
a 3 ( 12 m + t ) 0 ( mod 4 ) , for t { 2 , 3 , 6 , 11 } .
Theorem 6.
For m 0 , we have
a 4 ( 2 m + 1 ) 0 ( mod 2 ) ,
a 4 ( 32 m + t ) 0 ( mod 4 ) , for t { 6 , 30 }
a 4 ( 64 m + 50 ) 0 ( mod 4 ) .
Theorem 7.
For m 0 , we have
a 5 ( 6 m + 2 ) 0 ( mod 2 ) ,
a 5 ( 6 m + 4 ) 0 ( mod 4 ) ,
a 5 ( 18 m + 12 ) 0 ( mod 4 ) ,
a 5 ( 54 m + 42 ) 0 ( mod 4 ) ,
a 5 ( 162 m + 114 ) 0 ( mod 4 ) .
Theorem 8.
For m 0 , we have
a 6 ( 3 m + 1 ) 0 ( mod 2 ) ,
a 6 ( 3 m + 2 ) 0 ( mod 4 ) ,
a 6 ( 4 m + 3 ) 0 ( mod 8 ) ,
a 6 ( 8 m + t ) 0 ( mod 4 ) , for t { 4 , 5 }
a 6 ( 8 m + t ) 0 ( mod 16 ) , for t { 6 , 7 }
a 6 ( 12 m + 3 ) 0 ( mod 8 ) ,
a 6 ( 16 m + 8 ) 0 ( mod 4 ) ,
a 6 ( 24 m + 6 ) 0 ( mod 8 ) ,
a 6 ( 80 m + t ) 0 ( mod 4 ) , for t { 18 , 64 } .
Theorem 9.
For m 0 , we have
a 7 ( 6 m + 4 ) a 7 ( 24 m + 16 ) ( mod 4 ) ,
a 7 ( 9 m + t ) 0 ( mod 4 ) , for t { 3 , 6 }
a 7 ( 15 m + t ) 0 ( mod 4 ) , for t { 2 , 8 , 11 , 14 }
a 7 ( 12 m + t ) 0 ( mod 4 ) , for t { 7 , 10 }
a 7 ( 24 m + 13 ) 0 ( mod 4 ) ,
a 7 ( 48 m + 28 ) 0 ( mod 4 ) .
Theorem 10.
For prime p 5
a 8 3 p 2 m + 3 p i + p 2 1 8 0 ( mod 2 ) ,
where i = 1 , 2 , , ( p 1 ) .
Theorem 11.
For m 0 , we have
a 8 ( 9 m + 1 ) a 8 ( m ) ( mod 4 ) ,
a 8 ( 9 m + 4 ) 0 ( mod 4 ) ,
a 8 ( 9 m + 7 ) 0 ( mod 4 ) .
Theorem 12.
For m 0 , we have
a 9 ( 3 m + 1 ) 0 ( mod 2 ) ,
a 9 ( 3 m + 2 ) 0 ( mod 4 ) ,
a 9 ( 18 m + 9 ) 0 ( mod 3 ) ,
a 9 ( 18 m + 15 ) 0 ( mod 3 ) .
Theorem 13.
For m 0 , we have
a 10 ( 4 m + 3 ) 0 ( mod 4 ) ,
a 10 ( 8 m + t ) 0 ( mod 4 ) , for t { 2 , 5 } ,
a 10 ( 16 m + t ) 0 ( mod 4 ) , for t { 9 , 12 , 14 } ,
a 10 ( 32 m + 20 ) 0 ( mod 4 ) ,
a 10 ( 48 m + t ) 0 ( mod 4 ) , for t { 22 , 38 } .
  • Group 2
  • In this group, we have the following RRTIs with identity nos. 1, 36, and 37 in Ref. [12]. These RRTIs have the same congruences.
Table 2. Rogers–Ramanujan type identities.
Table 2. Rogers–Ramanujan type identities.
FunctionSum Side=Product Side
A 11 ( q ) m = 0 ( 1 ; q ) m q m 2 ( q ; q 2 ) 2 m = [ q 3 , q , q 2 ; q 3 ] ( q ; q )
A 12 ( q ) m = 0 ( 1 ; q ) 2 m q m ( q 2 ; q 2 ) m = ( q ; q ) ( q ; q ) [ q 6 , q 3 , q 3 ; q 6 ]
A 13 ( q ) m = 0 ( 1 ; q ) m q m 2 ( q ; q 2 ) m ( q ; q ) m = ( q ; q ) ( q ; q ) [ q 6 , q 3 , q 3 ; q 6 ]
Theorem 14.
For m 0 and i = 11 , 12 , and 13, we have
a i ( 3 m + 1 ) 0 ( mod 2 ) ,
a i ( 3 m + 2 ) 0 ( mod 4 ) ,
a i ( 4 m + 2 ) 0 ( mod 4 ) ,
a i ( 4 m + 3 ) 0 ( mod 6 ) ,
a i ( 6 m + 5 ) 0 ( mod 16 ) ,
a i ( 8 m + 4 ) 0 ( mod 2 ) ,
a i ( 8 m + 5 ) 0 ( mod 4 ) ,
a i ( 8 m + t ) 0 ( mod 12 ) , for t { 6 , 7 }
a i ( 24 m + 14 ) 0 ( mod 8 ) ,
a i ( 24 m + 20 ) 0 ( mod 16 ) ,
a i ( 32 m + 24 ) 0 ( mod 8 ) ,
a i ( 40 m + t ) 0 ( mod 4 ) , for t { 17 , 33 }
a i ( 40 m + t ) 0 ( mod 12 ) , for t { 11 , 19 }
a i ( 64 m + 40 ) 0 ( mod 8 ) .
  • Group 3
  • In this group, we use the following RRTIs from Ref. [12] with identity nos. 3, 39, 46, and 103. The identities A 14 ( q ) , A 15 ( q ) and A 16 ( q ) , A 17 ( q ) have the same congruences.
Table 3. Rogers–Ramanujan type identities.
Table 3. Rogers–Ramanujan type identities.
FunctionSum Side=Product Side
A 14 ( q ) m = 0 ( q ; q ) m q m ( m + 1 ) ( q ; q ) m ( q ; q 2 ) m + 1 = [ q 3 , q 3 , q 3 ; q 3 ] ( q ; q )
A 15 ( q ) m = 0 ( q ; q ) 2 m q m ( q 2 ; q 2 ) m = ( q ; q ) ( q ; q ) [ q 6 , q , q 5 ; q 6 ]
A 16 ( q ) m = 0 ( q 2 ; q 2 ) m q m ( m + 1 ) ( q ; q ) 2 m + 1 = ( q 2 ; q 2 ) ( q 2 ; q 2 ) [ q 6 , q , q 5 ; q 6 ]
A 17 ( q ) m = 0 ( q 2 ; q 2 ) m q m ( m + 1 ) ( q ; q ) 2 m + 1 = [ q 6 , q , q 5 ; q 6 ] ( q ; q )
Theorem 15.
For m 0 and i = 14 , 15 , we have
a i ( 4 m + 2 ) 0 ( mod 2 ) ,
a i ( 4 m + 3 ) 0 ( mod 4 ) ,
a i ( 16 m + 13 ) 0 ( mod 4 ) ,
a i ( 16 m + t ) 0 ( mod 8 ) , for t { 11 , 15 } .
Theorem 16.
For m 0 and i = 16 , 17 , we have
a i ( 4 m + 1 ) a i ( m ) ( mod 4 ) ,
a i ( 8 m + 4 ) 0 ( mod 4 ) ,
a i ( 8 m + 6 ) 0 ( mod 8 ) ,
a i ( 16 m + t ) 0 ( mod 8 ) , for t { 11 , 15 } .

4. Proofs of Main Results

Proof of Theorem 3.
Consider
m = 0 a 1 ( m ) q m = ( q ; q ) ( q ; q ) [ q 4 , q 2 , q 2 ; q 4 ] = f 2 3 f 4 1 f 1 2
m = 0 a 1 ( m ) q m = f 2 3 f 4 f 8 5 f 2 5 f 16 2 + 2 q f 4 2 f 16 2 f 2 5 f 8 .
Extracting even and odd terms, we obtain
m = 0 a 1 ( 2 m ) q m = f 4 5 f 2 f 8 2 1 f 1 2 ,
m = 0 a 1 ( 2 m + 1 ) q m = 2 f 2 f 8 2 f 4 1 f 1 2 .
Substituting (8) in (100), on extracting even and odd terms, we obtain
m = 0 a 1 ( 4 m ) q m = f 2 5 f 4 3 f 1 6 f 8 2 ,
m = 0 a 1 ( 4 m + 2 ) q m = 2 f 2 7 f 8 2 f 1 6 f 4 3 .
From (103), we also reach (26)
m = 0 a 1 ( 4 m + 2 ) q m 2 f 2 4 f 8 2 f 4 3 ( mod 4 ) ,
and we extract even terms to reach (29). On bringing out the odd terms, from the above equation and using (25), we have
m = 0 a 1 ( 8 m + 2 ) q m 2 f 1 4 f 4 2 f 2 3 2 f 4 2 f 2 ( mod 4 ) .
Extracting odd terms from the above equation to obtain (31) for t = 10 and on extracting even terms, we obtain
m = 0 a 1 ( 16 m + 2 ) q m 2 f 2 2 f 1 ( mod 4 ) .
Using (22) in the above equation and extracting the terms involving q 3 m + 2 , we divide by q 2 and replace q 3 by q to obtain (33).
  • On substituting (8) in (101), extracting even and odd terms, we obtain
m = 0 a 1 ( 4 m + 1 ) q m = 2 f 4 9 f 2 f 8 2 1 f 1 4 ,
m = 0 a 1 ( 4 m + 3 ) q m = 4 f 4 3 f 2 f 8 2 1 f 1 4 .
From (105), we readily reach (27). Putting (10) in (104) and (105), then extracting odd terms from both equations, we obtain (28) and (30), respectively. Consider (102),
m = 0 a 1 ( 4 m ) q m = f 2 5 f 4 3 f 1 6 f 8 2 f 2 3 f 4 3 f 8 2 1 f 1 2 ( mod 4 ) .
Applying (8) in the above relation, extracting odd terms, we have
m = 0 a 1 ( 8 m + 4 ) q m 2 f 2 5 f 8 2 f 4 3 1 f 1 2 ( mod 4 ) ,
and again putting (8) then extracting odd terms gives (31) for t = 12 , and extracting even terms gives
m = 0 a 1 ( 16 m + 4 ) q m 2 f 4 7 f 2 3 f 8 2 ( mod 4 ) .
Extracting the odd terms from the above equation, we reach (32). □
Proof of Theorem 4.
m = 0 a 2 ( m ) q m = ( q ; q ) ( q ; q ) [ q 4 , q 2 , q 2 ; q 4 ] = f 4 5 f 8 2 f 2 1 f 1 2 .
Using (8) in above equation, by extracting even and odd terms, we have
m = 0 a 2 ( 2 m ) q m = f 2 5 f 4 3 f 1 6 f 8 2 ,
m = 0 a 2 ( 2 m + 1 ) q m = 2 f 2 7 f 8 2 f 1 6 f 4 3 .
Putting (8) in (106) and extracting odd terms, we obtain
m = 0 a 2 ( 4 m + 2 ) q m 6 f 4 7 f 8 2 ( mod 4 ) .
Again, extracting odd terms from the above equation to obtain (35), and then extracting even terms, we obtain
m = 0 a 2 ( 8 m + 2 ) q m 6 f 2 7 f 4 2 ( mod 4 ) .
On extracting odd terms, we obtain (37).
  • If we consider (107) and then substitute (8), we have
m = 0 a 2 ( 2 m + 1 ) q m = 2 f 2 7 f 8 2 f 4 3 f 8 5 f 2 5 f 16 2 + 2 q f 4 2 f 16 2 f 2 5 f 8 3
Then, by extracting odd terms to obtain (34), and on taking modulo 8, we have
m = 0 a 2 ( 4 m + 3 ) q m 4 f 4 11 f 1 8 f 2 f 8 2 4 f 4 11 f 2 5 f 4 2 ( mod 8 ) .
By extracting odd terms from above we obtain (36). □
Proof of Theorem 5.
Consider
m = 0 a 3 ( m ) q m = ( q ; q ) ( q ; q ) [ q 4 , q 4 , q 4 ; q 4 ] = f 2 f 8 2 f 4 1 f 1 2 .
Substituting the value from (8), we obtain
m = 0 a 3 ( m ) q m = f 2 f 8 2 f 4 f 8 5 f 2 5 f 16 2 + 2 q f 4 2 f 16 2 f 2 5 f 8 .
Extracting even and odd terms, we obtain
m = 0 a 3 ( 2 m ) q m = f 4 7 f 2 f 8 2 1 f 1 4 ,
m = 0 a 3 ( 2 m + 1 ) q m = 2 f 4 f 2 f 8 2 1 f 1 4 .
Using (10) in both (109) and (110), we then extract the odd terms from both of them to obtain (39) and (40), respectively. Again, from (108),
m = 0 a 3 ( m ) q m = f 2 f 1 2 f 8 2 f 4 .
Using (20) and (22), we have
m = 0 a 3 ( m ) q m = f 6 4 f 9 6 f 3 8 f 18 3 + 2 q f 6 3 f 9 3 f 3 7 + 4 q 2 f 6 2 f 18 3 f 3 6 f 24 f 36 2 f 12 f 72 + q 4 f 72 2 f 36
Then, we extract the terms involving q 3 m and replace with q 3 by q to obtain
m = 0 a 3 ( 3 m ) q m f 3 2 f 8 f 12 2 f 4 f 6 f 24 ( mod 4 ) .
Next, extract the terms involving q 3 m + 2 from (111), dividing both sides by q 2 and replacing q 3 by q to obtain
m = 0 a 3 ( 3 m + 2 ) q m = 4 f 2 2 f 6 3 f 8 f 12 2 f 1 6 f 4 f 24 + 2 q f 2 3 f 3 3 f 24 2 f 1 7 f 12 .
From the above equation, we readily reach (38). Now, using (9) in (112), we have
m = 0 a 3 ( 3 m ) q m f 8 f 12 2 f 4 f 6 f 24 f 6 f 24 5 f 12 2 f 48 2 2 q 3 f 6 f 48 2 f 24 ( mod 4 ) .
On extracting even and odd terms, we obtain
m = 0 a 3 ( 6 m ) q m f 4 f 12 4 f 2 f 24 2 ( mod 4 ) ,
m = 0 a 3 ( 6 m + 3 ) q m 2 q f 4 f 6 2 f 24 2 f 2 f 12 2 ( mod 4 ) .
We extract the odd and even terms from (114) and (115), respectively, to obtain (41) for t = 3 , 6 . From (113), we have
m = 0 a 3 ( 3 m + 2 ) q m 2 q f 24 2 f 12 f 3 3 f 1 ( mod 4 ) .
Using (15), then extracting the even and odd terms, we obtain
m = 0 a 3 ( 6 m + 2 ) q m 2 q f 12 2 f 6 3 f 2 f 6 ( mod 4 ) ,
m = 0 a 3 ( 6 m + 5 ) q m 2 f 2 2 f 12 2 f 6 ( mod 4 ) .
We extract even and odd terms from (116) and (117), respectively, to obtain (41) for t = 2 , 11 . □
Proof of Theorem 6.
m = 0 a 4 ( m ) q m = [ q 6 , q 3 , q 3 ; q 6 ] ( q 2 ; q 2 ) = f 3 2 1 f 2 f 6 .
Substituting (9) in the above equation to obtain
m = 0 a 4 ( m ) q m = 1 f 2 f 6 f 6 f 24 5 f 12 2 f 48 2 2 q 3 f 6 f 48 2 f 24 ,
then extracting even terms, we obtain (118) and on extracting odd terms we obtain (42).
m = 0 a 4 ( 2 m ) q m = f 12 5 f 24 2 1 f 1 f 3 .
Using (12) in (118), and on extracting odd terms and taking modulo 4, we have
m = 0 a 4 ( 4 m + 2 ) q m f 6 4 f 2 3 f 4 2 1 f 3 2 ( mod 4 ) .
Using (8), and again on extracting even and odd terms, we obtain
m = 0 a 4 ( 8 m + 2 ) q m f 12 5 f 2 2 f 24 2 f 1 3 f 3 ( mod 4 ) ,
m = 0 a 4 ( 8 m + 6 ) q m 2 q f 6 2 f 24 2 f 2 2 f 12 f 1 3 f 3 ( mod 4 ) .
Substituting (13) in (119), extracting even terms, we obtain
m = 0 a 4 ( 16 m + 2 ) q m f 6 4 f 2 3 f 12 2 1 f 1 2 ( mod 4 ) .
Using (8) and extracting odd terms we have
m = 0 a 4 ( 32 m + 18 ) q m 2 f 2 f 8 2 f 4 ( mod 4 ) .
We extract odd terms to obtain (44). Consider (120), and by using (13) upon bringing out the even and odd terms, we obtain
m = 0 a 4 ( 16 m + 6 ) q m 2 q f 12 2 f 6 2 f 2 ( mod 4 ) ,
m = 0 a 4 ( 16 m + 14 ) q m 2 f 12 2 f 2 2 f 6 ( mod 4 ) .
We extract the even and odd terms from (121) and (122), respectively, to obtain (43) for t = 6 , 30 . □
Proof of Theorem 7.
m = 0 a 5 ( m ) q m = ( q 2 ; q 2 ) ( q 2 ; q 2 ) [ q 6 , q 3 , q 3 ; q 6 ] = f 4 f 6 5 f 2 2 f 12 2 1 f 3 2 .
Using (8) in the above equation,
m = 0 a 5 ( m ) q m = f 4 f 6 5 f 2 2 f 12 2 f 24 5 f 6 5 f 48 2 + 2 q 3 f 12 2 f 48 2 f 6 5 f 24
Extracting even terms then using (20), we extract the terms involving the q 3 m , q 3 m + 1 , and q 3 m + 2 terms, and we obtain (123), (45), and (46), respectively.
m = 0 a 5 ( 6 m ) q m f 2 4 f 3 6 f 1 5 f 6 3 .
Taking modulo 4,
m = 0 a 5 ( 6 m ) q m f 1 3 f 3 6 f 6 3 ( mod 4 ) .
Using (21), we have
m = 0 a 5 ( 6 m ) q m f 3 6 f 6 3 ( f 3 a ( q 3 ) 3 q f 9 3 ) ( mod 4 ) .
Extracting the term involving q 3 m + 2 and q 3 m + 1 , we have (47) and
m = 0 a 5 ( 18 m + 6 ) q m f 3 3 f 1 2 f 2 ( mod 4 ) .
Using (22) in the above equation, extracting the terms involving q 3 m + 1 and q 3 m , we obtain (48) and
m = 0 a 5 ( 54 m + 6 ) q m f 3 2 f 1 3 f 6 ( mod 4 ) .
Using (21) and extracting the terms involving q 3 m + 2 , we obtain (49). □
Proof of Theorem 8.
m = 0 a 6 ( m ) q m = f 2 f 4 2 f 8 1 f 1 2 .
Using (8) and extracting even and odd terms, we have
m = 0 a 6 ( 2 m ) q m = f 2 2 f 4 4 f 8 2 1 f 1 4 ,
m = 0 a 6 ( 2 m + 1 ) q m = f 2 4 f 8 2 f 4 2 1 f 1 4 .
Substituting the value from (8) in (125), on extracting the even and odd terms, we have
m = 0 a 6 ( 4 m ) q m = f 2 18 f 4 6 f 1 12 ,
m = 0 a 6 ( 4 m + 2 ) q m = 4 f 2 6 f 4 2 f 1 8 .
Taking modulo 4 in (127),
m = 0 a 6 ( 4 m ) q m f 2 12 f 4 6 ( mod 4 ) .
Extracting the odd terms gives (53) (for t = 4 ), and on extracting even terms gives
m = 0 a 6 ( 8 m ) q m f 2 3 ( mod 4 ) .
Extracting the odd terms gives (56), and on extracting even terms gives
m = 0 a 6 ( 16 m ) q m f 1 3 ( mod 4 ) .
By using Jacobi’s triple-product identity, we have
m = 0 a 6 ( 16 m ) q m n = 0 ( 1 ) m ( 2 m + 1 ) q m ( m + 1 ) / 2 ( mod 4 ) .
Since m ( m + 1 ) / 2 2 , 4 ( mod 5 ) , we obtain (58). Consider (128) and taking modulo 16,
m = 0 a 6 ( 4 m + 2 ) q m 4 f 2 2 f 4 2 ( mod 4 ) .
Extracting odd terms from the above equation gives (54). Consider (126) and using (10), by extracting even and odd terms, we obtain
m = 0 a 6 ( 4 m + 1 ) q m = 2 f 2 12 f 2 4 f 4 2 1 f 1 2 ,
m = 0 a 6 ( 4 m + 3 ) q m = 8 f 4 4 f 1 6 .
Consider (129) and using (8), extracting odd terms gives (53) (for t = 5 ). Similarly, taking modulo 16 in (130), we obtain
m = 0 a 6 ( 4 m + 3 ) q m 8 f 4 4 f 2 3 ( mod 16 ) .
Extracting odd terms gives (54) (for t = 16 ). Consider (124) and using (19) and (20)
m = 0 a 6 ( m ) q m = f 36 2 f 72 2 q 4 f 12 f 72 2 f 24 f 36 f 6 4 f 9 6 f 3 8 f 18 3 + 2 q f 6 3 f 9 3 f 3 7 + 4 q 2 f 6 2 f 18 3 f 3 6 .
Extracting the terms involving q 3 m , q 3 m + 1 , and q 3 m + 2 gives (131), (50), and (51), respectively.
m = 0 a 6 ( 3 m ) q m f 12 2 f 6 4 f 24 f 6 3 1 f 3 2 ( mod 8 ) .
Using (8) and extracting even and odd terms, we have
m = 0 a 6 ( 6 m ) q m f 6 2 f 12 4 f 24 2 1 f 3 4 ( mod 4 ) ,
m = 0 a 6 ( 6 m + 3 ) q m 2 q f 6 4 f 24 2 f 12 2 . 1 f 3 4 ( mod 8 ) .
Using (10) in (132) and extracting odd terms, we have
m = 0 a 6 ( 12 m + 6 ) q m 4 q f 6 2 f 12 2 ( mod 8 ) .
On extracting even terms we arrive at (57). Consider (133) and using (10), which, on extracting even terms, gives (55). □
Proof of Theorem 9.
m = 0 a 7 ( m ) q m = f 2 f 1 2 f 5 2 f 10 .
Using (19) and (20), we have
m = 0 a 7 ( m ) q m = f 6 4 f 9 6 f 3 8 f 18 3 + 2 q f 6 3 f 9 3 f 3 7 + 4 q 2 f 6 2 f 18 3 f 3 6 f 45 2 f 90 2 q 5 f 15 f 90 2 f 30 f 45 .
By extracting the terms involving q 3 m , q 3 m + 1 , and q 3 m + 2 and taking modulo 4, we have
m = 0 a 7 ( 3 m ) q m f 3 6 f 15 2 f 6 3 f 30 ( mod 4 ) ,
m = 0 a 7 ( 3 m + 1 ) q m 2 f 6 f 3 f 1 ( mod 4 ) ,
m = 0 a 7 ( 3 m + 2 ) q m 2 q f 5 f 30 2 f 7 f 45 ( mod 4 ) .
Extracting the terms involving q 3 m + 1 , q 3 m + 2 and dividing by q , q 2 , respectively, by replacing q 3 by q, we obtain (60). Consider (135) and using (17), on extracting even and odd terms, we obtain
m = 0 a 7 ( 6 m + 1 ) q m 2 f 8 f 12 2 f 4 f 24 ( mod 4 ) ,
m = 0 a 7 ( 6 m + 4 ) q m 2 f 4 2 f 6 f 24 f 2 f 8 f 12 ( mod 4 ) .
Consider (137), on extracting even and odd terms, we obtain (139) and (62) (for t = 7 ), respectively.
m = 0 a 7 ( 12 m + 1 ) q m 2 f 4 f 6 2 f 2 f 12 ( mod 4 ) .
Extracting odd terms from the above equation gives (63). From (138), extracting even and odd terms gives (140) and (62) (for t = 10 ), respectively.
m = 0 a 7 ( 12 m + 4 ) q m 2 f 2 2 f 12 f 4 f 6 f 3 f 1 ( mod 4 ) .
Using (17), extracting even and odd terms, we have
m = 0 a 7 ( 24 m + 4 ) q m 2 f 8 f 12 f 4 f 24 ( mod 4 ) ,
m = 0 a 7 ( 24 m + 16 ) q m 2 f 4 2 f 6 f 24 f 2 f 8 f 12 ( mod 4 ) .
From (136) and (142), we have a 7 ( 6 m + 4 ) a 7 ( 24 m + 16 ) ( mod 4 ) . Extracting odd terms from (141), we arrive at (64). Consider (136), and by extracting the terms involving q 5 m , q 5 m + 2 , q 5 m + 3 , and q 5 m + 4 , we obtain (61). □
Proof of Theorems 10 and 11.
m = 0 a 8 ( m ) q m = [ q 12 , q 4 , q 8 ; q 12 ] ( q ; q ) = f 4 f 1 .
Using (18), by extracting the terms involving q 3 m and q 3 m + 1 , we have
m = 0 a 8 ( 3 m ) q m = f 4 f 6 4 f 1 3 f 12 2 ,
m = 0 a 8 ( 3 m + 1 ) q m = f 2 2 f 3 3 f 12 f 1 4 f 6 2 .
Taking modulo 2 in (143),
m = 0 a 8 ( 3 m ) q m f 2 f 1 f 1 ( mod 2 ) .
From Lemma 4, we have
m = 0 a 8 ( 3 m ) q m k = ( p 1 ) 2 k ( ± p 1 ) / 6 ( p 1 ) 2 ( 1 ) k q 3 k 2 + k 2 f ( q ( 3 p 2 + ( 6 k + 1 ) p ) 2 , q ( 3 p 2 ( 6 k + 1 ) p ) 2 ) + ( 1 ) ( ± p 1 ) 6 q ( p 2 1 ) 24 f p 2 ( mod 2 ) .
By extracting the terms involving q p m + ( p 2 1 ) / 24 , dividing by q ( p 2 1 ) / 24 , and replacing q p m by q m , we obtain
m = 0 a 8 3 p m + p 2 1 8 q m ( 1 ) ( ± p 1 ) / 6 f p ( mod 2 ) .
Extracting the terms involving q p m + i for i = 1 , 2 , , ( p 1 ) ,
m = 0 a 8 3 p 2 m + 3 p i + p 2 1 8 q m 0 ( mod 2 ) .
which proves (65). Taking modulo 4 in (144), we have
m = 0 a 8 ( 3 m + 1 ) q m f 2 2 f 3 3 f 12 f 2 2 f 6 2 ( mod 4 ) .
Extracting the terms involving q 3 m , q 3 m + 1 , and q 3 m + 2 from above, we obtain (145), (67), and (68), respectively.
m = 0 a 8 ( 9 m + 1 ) q m f 1 3 f 4 f 2 2 f 4 f 1 ( mod 4 )
From above, it is easy to conclude (66). □
Proof of Theorem 12.
m = 0 a 9 ( m ) q m = ( q ; q ) ( q ; q ) [ q 12 , q 3 , q 9 ; q 12 ] = f 2 f 3 f 12 f 1 2 f 6 .
Using (20), extracting the terms involving q 3 m , q 3 m + 1 , and q 3 m + 2 , we obtain (146), (69), and (70), respectively.
m = 0 a 9 ( 3 m ) q m = f 2 3 f 3 6 f 4 f 1 7 f 6 3 .
Taking modulo 3, we have
m = 0 a 9 ( 3 m ) q m f 3 3 f 6 2 f 4 f 1 ( mod 3 ) .
Using (18), we obtain
m = 0 a 9 ( 3 m ) q m f 3 3 f 6 2 f 12 f 18 4 f 3 3 f 36 2 + q f 6 2 f 9 3 f 36 f 3 4 f 18 2 + 2 q 2 f 6 f 18 f 36 f 3 3 ( mod 3 ) .
Extracting the terms involving q 3 m and replacing q 3 by q, we have
m = 0 a 9 ( 9 m ) q m f 4 f 6 4 f 2 2 f 12 2 ( mod 3 ) .
On extracting odd terms, we obtain (71). Extracting the terms involving q 3 m + 1 , dividing by q, and replacing q 3 by q from (147), we have
m = 0 a 9 ( 9 m + 6 ) q m 2 f 6 f 12 f 2 ( mod 3 ) .
On extracting odd terms, we reach (72). □
Proof of Theorem 13.
m = 0 a 10 ( m ) q m = ( q ; q ) ( q ; q ) [ q 12 , q 6 , q 6 ; q 12 ] = f 2 f 6 2 f 1 2 f 12 .
Using (8), extracting the even and odd terms and taking modulo 4, we have
m = 0 a 10 ( 2 m ) q m f 4 5 f 2 2 f 6 f 8 2 · f 3 2 ( mod 4 ) ,
m = 0 a 10 ( 2 m + 1 ) q m 2 f 8 ( mod 4 ) .
Using (9) in (148), we obtain
m = 0 a 10 ( 2 m ) q m f 4 5 f 2 2 f 6 f 8 2 f 6 f 24 5 f 12 2 f 48 2 q 3 f 6 f 48 2 f 24 ( mod 4 ) .
Extracting even and odd terms, we have
m = 0 a 10 ( 4 m ) q m f 2 5 f 12 5 f 4 2 f 6 2 f 24 2 1 f 1 2 ( mod 4 ) ,
m = 0 a 10 ( 4 m + 2 ) q m 2 q f 2 4 f 24 2 f 4 2 f 12 ( mod 4 ) .
Substituting (8) in (150) and extracting odd terms, we have
m = 0 a 10 ( 8 m + 4 ) q m 2 f 6 4 f 8 2 f 4 f 12 2 ( mod 4 ) .
On extracting odd and even terms, we reach (75) (for t = 12 ) and
m = 0 a 10 ( 16 m + 4 ) q m 2 f 4 2 f 2 ( mod 4 ) ,
respectively. Extracting odd terms from the above equation, we obtain (76). Consider (149) by extracting odd and even terms to obtain (73) and
m = 0 a 10 ( 4 m + 1 ) q m 2 f 4 ( mod 4 ) ,
respectively. Extracting odd and even terms from the above equation, we have (74) (for t = 5 ) and
m = 0 a 10 ( 8 m + 1 ) q m 2 f 2 ( mod 4 ) ,
respectively. On extracting odd terms from the above equation, we arrive at (75) (for t = 9 ). Consider (151), and by extracting odd and even terms, we have (74) and
m = 0 a 10 ( 8 m + 6 ) q m 2 f 12 2 f 6 ( mod 4 ) ,
respectively. Extracting odd and even terms from the above equation, we obtain (75) (for t = 14 ) and
m = 0 a 10 ( 16 m + 6 ) q m 2 f 6 2 f 3 ( mod 4 ) ,
respectively. We extract the terms involving q 3 m + 1 , q 3 m + 2 from the above equation to obtain (77). □
Proof of Theorem 14.
For i = 11 , 12 , 13 , we consider
m = 0 a i ( m ) q m = f 2 f 3 2 f 6 f 1 2 .
Using (16) in the above equation, and extracting even and odd terms, we have
m = 0 a i ( 2 m ) q m = f 2 4 f 6 2 f 4 f 12 1 f 1 4 ,
m = 0 a i ( 2 m + 1 ) q m = 2 f 2 f 4 f 12 f 6 f 3 f 1 3 .
Using (10) in (153), again extracting the even and odd terms, we obtain
m = 0 a i ( 4 m ) q m f 2 8 f 4 4 ( mod 2 ) ,
m = 0 a i ( 4 m + 2 ) q m 4 f 2 f 4 4 f 6 ( mod 12 ) .
From (156), we obtain (80). Now, on extracting odd terms from (155) and (156), we reach (83) and (85) (for t = 6 ), respectively. From (153), we have
m = 0 a i ( 4 m ) q m f 2 9 f 6 f 4 4 f 3 2 f 1 2 ( mod 8 ) .
Using (16), extracting even and odd terms, we have
m = 0 a i ( 8 m ) q m f 6 2 f 4 f 12 f 1 4 ( mod 8 ) ,
m = 0 a i ( 8 m + 4 ) q m 2 f 4 f 12 f 2 f 6 . f 1 f 3 ( mod 8 ) .
Substituting the values from (10) in (157) and extracting even terms and odd terms, we obtain
m = 0 a i ( 16 m ) q m f 3 2 f 2 10 f 2 f 6 f 4 4 1 f 1 2 ( mod 8 ) ,
m = 0 a i ( 16 m + 8 ) q m 4 f 4 4 f 2 2 ( mod 8 ) .
On extracting odd terms from (160), we obtain (88), and extracting even terms gives us
m = 0 a i ( 32 m + 8 ) q m 4 f 2 3 ( mod 8 ) .
Extracting odd terms gives us (91). Now consider (154), and by using (14) and extracting even and odd terms, we have
m = 0 a i ( 4 m + 1 ) q m 2 f 2 3 ( mod 4 ) ,
m = 0 a i ( 4 m + 3 ) q m 6 f 6 3 ( mod 12 ) .
Additionally, we obtain (81). From (161), extracting the odd terms gives us (84), while extracting even terms gives
m = 0 a i ( 8 m + 1 ) q m 2 f 1 3 ( mod 4 ) .
According to Jacobi’s triple product
m = 0 a i ( 8 m + 1 ) q m 2 m = 0 ( 1 ) m ( 2 m + 1 ) q m ( m + 1 ) / 2 ( mod 4 ) .
As m ( m + 1 ) / 2 2 , 4 ( mod 5 ) , we obtain (90). Consider (162) and extracting the odd terms to obtain (85) (for t = 7 ), and by extracting even terms and using Jacobi’s triple product, we ultimately reach (89).
Consider (152), using (20), and extracting the terms involving q 3 m , q 3 m + 1 , and q 3 m + 2 , we obtain
m = 0 a i ( 3 m ) q m f 3 4 f 6 2 ( mod 3 ) ,
m = 0 a i ( 3 m + 1 ) q m 0 ( mod 2 ) ,
m = 0 a i ( 3 m + 2 ) q m 0 ( mod 6 ) .
Additionally,
m = 0 a i ( 3 m + 2 ) q m 4 f 6 3 f 2 ( mod 16 ) .
On extracting odd parts, we obtain (82), and on extracting even parts and using (15), we have
m = 0 a i ( 6 m + 2 ) q m 4 f 4 3 f 6 2 f 2 2 f 12 + q f 12 3 f 4 ( mod 16 ) .
On extracting odd terms, we obtain
m = 0 a i ( 12 m + 8 ) q m 4 f 6 3 f 2 ( mod 16 ) .
On extracting odd terms, we obtain (87). Taking modulo 8 for (166), using (15), and extracting the even terms gives
m = 0 a i ( 12 m + 2 ) q m 4 f 2 2 ( mod 8 ) .
On extracting odd terms, we reach (86). □
Proof of Theorem 15.
For i = 14 , 15, we consider
m = 0 a i ( m ) q m = f 6 2 1 f 1 f 3
Substituting (12) in the above equation and then extracting even and odd terms, we have
m = 0 a i ( 2 m ) q m = f 4 2 f 6 5 f 2 f 3 2 f 12 2 · 1 f 1 2 ,
m = 0 a i ( 2 m + 1 ) q m = f 2 5 f 12 2 f 4 2 f 6 · 1 f 1 4 .
Taking modulo 2 in (167), we have
m = 0 a i ( 2 m + 1 ) q m f 4 2 f 6 4 f 2 2 f 12 2 ( mod 2 ) .
On extracting odd terms from the above equation, we readily reach (92). Consider (168) and substituting (10),
m = 0 a i ( 2 m + 1 ) q m = f 2 5 f 12 2 f 4 2 f 6 f 4 14 f 2 14 f 8 4 + 4 q f 4 2 f 8 4 f 2 10 .
On extracting odd terms, we obtain (93) and (170). Similarly, extracting even terms from the same, we have
m = 0 a i ( 4 m + 1 ) q m f 6 2 f 2 12 f 2 4 f 4 4 1 f 1 f 3 ( mod 4 ) ,
m = 0 a i ( 4 m + 3 ) q m 4 f 6 2 f 4 4 f 2 2 1 f 1 f 3 ( mod 8 ) .
Using (12) in (169) and extracting odd terms, we obtain
m = 0 a i ( 8 m + 5 ) q m f 2 3 f 12 2 f 4 2 f 16 ( mod 4 ) .
Extracting odd terms to reach (94). Consider (170) and using (12), on extracting even and odd terms, we obtain
m = 0 a i ( 8 m + 3 ) q m 4 f 2 f 4 2 f 6 4 f 12 2 ( mod 8 ) , m = 0 a i ( 8 m + 7 ) q m f 2 6 f 12 2 f 4 2 f 6 ( mod 8 ) .
Extracting odd terms from both the above equations to obtain (95). □
Proof of Theorem 16.
For i = 16 , 17, we consider
m = 0 a i ( m ) q m = f 12 f 6 · f 3 f 1 .
Using (17) and extracting even and odd terms, we have
m = 0 a i ( 2 m ) q m = f 2 f 8 f 12 2 f 4 f 24 1 f 1 2 ,
m = 0 a i ( 2 m + 1 ) q m = f 4 2 f 6 f 24 f 8 f 12 · 1 f 1 2 .
We use (8) in (171) and extract even and odd terms to obtain
m = 0 a i ( 4 m ) q m = f 4 6 f 6 2 f 2 f 8 2 f 12 ,
m = 0 a i ( 4 m + 2 ) q m = 2 f 2 f 6 2 f 8 2 f 12 1 f 1 4 .
Extracting odd terms from (173), we readily reach (97). Consider (172) and using (8), and on extracting even and odd terms, we obtain
m = 0 a i ( 4 m + 1 ) q m = f 2 2 f 4 4 f 12 f 1 4 f 6 f 8 2 f 3 f 1 ,
m = 0 a i ( 4 m + 3 ) q m = 2 f 2 4 f 3 f 8 2 f 12 f 1 5 f 4 2 f 6 .
Taking modulo 4 in (175),
m = 0 a i ( 4 m + 1 ) q m f 12 f 6 f 3 f 1 ( mod 4 ) ,
which implies a i ( 4 m + 1 ) a i ( m ) ( mod 4 ) . Now consider (174) and using (10), and on extracting odd terms, we obtain (98). Taking modulo 8 in (176), we have
m = 0 a i ( 4 m + 3 ) q m = 2 f 2 2 f 8 2 f 12 f 4 2 f 6 f 3 f 1 ( mod 8 ) .
Using (17) in the above and extracting even and odd terms, we have
m = 0 a i ( 8 m + 3 ) q m 2 f 4 f 8 f 12 2 f 2 f 24 ( mod 8 ) , m = 0 a i ( 8 m + 7 ) q m 2 f 4 4 f 6 f 24 f 2 2 f 8 f 12 ( mod 8 ) .
Extracting odd terms from the above equations, we obtain (99). □

5. Conclusions

This paper provides some congruences for Rogers–Ramanujan type identities to modulo powers of 2, 3, and 6. As mentioned in Section 1, these ’sum-product’ identities have been studied by many mathematicians in various contexts (see Refs. [5,18,25,26]). However, in the literature, to the best of our knowledge, we have not found any congruences for Rogers–Ramanujan type identities; instead, there is a huge selection of literature that studies congruences for partition functions. For instance, Ramanujan beautiful congruences for partition functions are shown as:
p ( 5 n + 4 ) 0 ( mod 5 ) , p ( 7 n + 5 ) 0 ( mod 7 ) , p ( 11 n + 6 ) 0 ( mod 11 ) .
These congruences are generalized and written in the form
p ( n δ ) 0 ( mod ) ,
where δ = ( 2 1 ) / 24 . The above three congruences were further extended to arbitrary powers of 5, 7, and 11 (for instance, see Ref. [27]). Thus, our paper adds one more direction to the study of Rogers–Ramanujan type identities. For future research, one could look for further interesting Rogers–Ramanujan type identities or others available in the literature to find their congruence modulo higher primes. Furthermore, one can think of generalizing the congruences that are proved in this paper. Moreover, it will be fascinating to prove these congruences using some other techniques, such as modular forms.

Author Contributions

Writing—original draft, V.G.; Writing—review & editing, M.R. All authors have read and agreed to the published version of the manuscript.

Funding

This research received no external funding.

Data Availability Statement

Not applicable.

Acknowledgments

The second author is supported by the SERB MATRICS Project Ref. No. MTR/ 2019/000123.

Conflicts of Interest

The authors have no conflict of interest.

Sample Availability

The manuscript has no associated data.

References

  1. Rogers, L.J. Second memoir on the expansion of certain infinite products. Proc. Lond. Math. Soc. 1893, 1, 318–343. [Google Scholar] [CrossRef]
  2. Lepowsky, J.; Milne, S.C. Lie algebraic approaches to classical partition identities. Adv. Math. 1978, 29, 15–59. [Google Scholar] [CrossRef] [Green Version]
  3. Andrews, G.E. Partitions: Yesterday and Today; New Zealand Mathematical Society: Wellington, New Zealand, 1979. [Google Scholar]
  4. Baxter, R.J. Exactly Solved Models in Statistical Mechanics; Academic Press: London, UK; New York, NY, USA, 1982. [Google Scholar]
  5. Andrews, G.E. On the proofs of the Rogers-Ramanujan identities. In q-Series and Partitions; Springer: Berlin, Germany, 1989; pp. 1–14. [Google Scholar]
  6. Ramanujan, S. Collected Papers of Srinivasa Ramanujan; Cambridge University Press: Cambridge, UK, 1927. [Google Scholar]
  7. Sills, A.V. An Invitation to the Rogers-Ramanujan Identities; CRC Press: Boca Raton, FL, USA, 2017. [Google Scholar]
  8. MacMahon, P.A. Combinatory Analysis; American Mathematical Society: Providence, RI, USA, 2001; Volume 137. [Google Scholar]
  9. Afsharijoo, P. Even–odd partition identities of Rogers–Ramanujan type. Ramanujan J. 2022, 57, 969–979. [Google Scholar] [CrossRef]
  10. Bailey, W.N. Identities of the Rogers–Ramanujan type. Proc. Lond. Math. Soc. 1948, 2, 1–10. [Google Scholar] [CrossRef]
  11. Slater, L.J. Further identities of the Rogers–Ramanujan type. Proc. Lond. Math. Soc. 1952, 2, 147–167. [Google Scholar] [CrossRef]
  12. Chu, W.; Zhang, W. Bilateral bailey lemma and Rogers–Ramanujan identities. Adv. Appl. Math. 2009, 42, 358–391. [Google Scholar] [CrossRef] [Green Version]
  13. Baxter, R.J. Rogers-Ramanujan identities in the hard hexagon model. J. Stat. Phys. 1981, 26, 427–452. [Google Scholar] [CrossRef]
  14. Kedem, R.; Klassen, T.R.; McCoy, B.M.; Melzer, E. Fermionic sum representations for comformal field theory characters. Phys. Lett. B 1993, 307, 68–76. [Google Scholar] [CrossRef] [Green Version]
  15. Agarwal, A.K.; Rana, M. Two new combinatorial interpretations of a fifth order mock theta function. J. Indian Math. Soc. 2007, 74, 11–24. [Google Scholar]
  16. Rana, M.; Agarwal, A.K. Frobenius partition theoretic interpretation of a fifth order mock theta function. Can. J. Pure Appl. Sci. 2009, 3, 859–863. [Google Scholar]
  17. Rana, M.; Sareen, J.K. On combinatorial extensions of some mock theta functions using signed partitions. Adv. Theor. Appl. Math. 2015, 10, 15–25. [Google Scholar]
  18. Agarwal, A.K. Rogers–Ramanujan identities for n–color partitions. J. Number Theory 1988, 28, 299–305. [Google Scholar] [CrossRef] [Green Version]
  19. Gupta, V.; Rana, M. On some combinatorics of Rogers–Ramanujan type identities using signed color partitions. In Current Trends in Mathematical Analysis and Its Interdisciplinary Applications; Springer: Berlin, Germany, 2019; pp. 99–114. [Google Scholar]
  20. Chan, H.C. Ramanujan’s cubic continued fraction and Ramanujan type congruences for a certain partition function. Int. J. Number Theory 2010, 6, 819–834. [Google Scholar] [CrossRef] [Green Version]
  21. Lin, B.L.S. Congruences modulo 27 for cubic partition pairs. J. Number Theory 2017, 171, 31–42. [Google Scholar] [CrossRef]
  22. Berndt, B.C. Number Theory in the Spirit of Ramanujan; American Mathematical Society: Providence, RI, USA, 2006. [Google Scholar]
  23. Hirschhorn, M.D. The Power of q. In Developments in Mathematics; Springer: Berlin, Germany, 2017; Volume 49. [Google Scholar]
  24. Cui, S.P.; Gu, N.S.S. Arithmetic properties of l-regular partitions. Adv. Appl. Math. 2013, 51, 507–523. [Google Scholar] [CrossRef]
  25. Agarwal, A.K. New classes of infinite 3-way partition identities. Ars Comb. 1996, 44, 33–54. [Google Scholar]
  26. Agarwal, A.K. Lattice paths and n-color partitions. Util. Math. 1998, 53, 70–80. [Google Scholar]
  27. Ahlgren, S.; Ono, K. Congruence properties for the partition function. Proc. Natl. Acad. Sci. USA 2001, 98, 12882–12884. [Google Scholar] [CrossRef] [PubMed] [Green Version]
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Share and Cite

MDPI and ACS Style

Gupta, V.; Rana, M. Some Congruences for the Coefficients of Rogers–Ramanujan Type Identities. Mathematics 2022, 10, 3582. https://0-doi-org.brum.beds.ac.uk/10.3390/math10193582

AMA Style

Gupta V, Rana M. Some Congruences for the Coefficients of Rogers–Ramanujan Type Identities. Mathematics. 2022; 10(19):3582. https://0-doi-org.brum.beds.ac.uk/10.3390/math10193582

Chicago/Turabian Style

Gupta, Vasudha, and Meenakshi Rana. 2022. "Some Congruences for the Coefficients of Rogers–Ramanujan Type Identities" Mathematics 10, no. 19: 3582. https://0-doi-org.brum.beds.ac.uk/10.3390/math10193582

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop