Abstract
In this paper, we explore Ramanujan-type congruences modulo 4 for the function , counting the positive divisors of n. We consider relations of the form with and . In this context, some conjectures are made and some Ramanujan-type congruences involving overpartitions are obtained.
MSC:
11A25; 11P83
1. Introduction
Recall [1] that an overpartition of the positive integer n is an ordinary partition of n where the first occurrence of parts of each size may be overlined. Let denote the number of overpartitions of n. For example, the overpartitions of the integer 3 are:
We see that . It is well-known that the generating function of is given by
Here and throughout this paper, we use the following customary q-series notation:
Many congruences for the number of overpartitions have been discovered in the recent years by authors such as Chen [2], Chen, Hou, Sun and Zhang [3], Chern and Dastidar [4], Dou and Lin [5], Fortin, Jacob and Mathieu [6], Hirschhorn and Sellers [7], Kim [8,9], Lovejoy and Osburn [10], Mahlburg [11], Xia [12], Xiong [13] and Yao and Xia [14].
Fortin, Jacob and Mathieu [6] founded in 2003 the first Ramanujan-type congruences modulo power of 2 for and for all n that cannot be written as a sum of s or less squares, they obtained that
This result is meaningful only for since, by Lagrange’s four-square theorem, all numbers can be written as a sum of four squares. A complete characterization of Ramanujan-type congruences modulo 16 for the overpartition function was provided in 2019 using the function that counts the positive divisors of n [15]. By the proofs of Theorems 1.3 and 1.4 in [15], we easily deduce the following result.
Theorem 1.
Let be a fixed integer. For all , we have
In this paper, apart from , we consider the overpartition function that counts the overpartitions of n into odd parts. The generating function for the number of overpartitions into odd parts is given by
The expression of the generating function for was first used by Lebesgue [16] in 1840 in the following series-product identity
Although authors such as Bessenrodt [17], Santos and Sills [18] utilized more recently the generating function (2) for , none of them connected their works to overpartitions into odd parts.
Many congruences for the number of overpartitions into odd parts have been discovered lately [19,20]. It appears that the first Ramanujan-type congruences modulo power of 2 for was found in 2006 by Hirschhorn and Sellers [20]. Very recently, Theorem 1 in [21], we introduced a complete characterization of Ramanujan-type congruences modulo 8 for the overpartition function considering again the divisor function . By the proof of Theorem 1 in [21], we easily deduce the following result.
Theorem 2.
Let be a fixed integer. For all , we have
Theorems 1 and 2 may be viewed as steps towards classifying all Ramanujan-type congruences for overpartitions, particularly because the divisibility properties of multiplicative functions are more directly accessible with elementary methods than those of functions defined in terms of partitions. Recall that a multiplicative function is an arithmetic function of a positive integer n with the property that = 1 and whenever a and b are coprime.
In this paper, motivated by Theorems 1 and 2, we consider to be a fixed integer and investigate pairs of positive integers for which the following statement is true:
There is a substantial amount of numerical evidence to conjecture the following.
Conjecture 1.
If the statement (3) is true, then there is an odd prime p such that α is divisible by and is divisible by p.
Since a multiplicative function is defined by its values at prime powers, this conjecture boils down to understanding how the divisibility properties of the divisor function at prime powers intersect with arithmetic progressions.
If the statement (3) is true for , then the statement (3) is true for any pair , with and . To prove this fact, it is enough to replace n by in (3). This makes us not very attracted to cases where is not a square of an odd prime.
Definition 1.
For each odd prime p, we define to be the set of nonnegative integers such that
for all nonnegative integers n.
Assuming Conjecture 1, we state the following.
Conjecture 2.
For each odd prime p, we have
Conjecture 3.
Let be a fixed integer. For each odd prime p, we have
Conjecture 4.
Let be a fixed integer. Then,
Assuming the last conjecture, we remark that there is not an odd prime p such that
for all nonnegative integers n.
In this paper, we consider some special cases of our conjectures and present a strategy for proving them. These special cases together with our Theorems 1 and 2 allow us to easily obtain some Ramanujan-type congruences for the overpartition functions and . Somewhat unrelated to our topics, we will show that these congruences are precursors of stronger congruences. In fact, these stronger congruences were discovered considering few Ramanujan-type congruences modulo 4 for the divisor function .
2. Some Special Cases
This section is devoted to the presentation of the proof strategy of some special cases of Conjectures 2 and 3 listed bellow. We will rely on the fact that the divisor function is a multiplicative function.
Theorem 3.
- (i)
- ;
- (ii)
- .
Theorem 4.
- (i)
- ;
- (ii)
- .
Theorem 5.
- (i)
- ;
- (ii)
- .
To proof these identities, the following steps have to be performed.
Step 1. The first step in all our proofs is to verify that for each ,
Step 2. For each , we prove that , for all .
Step 3. For each , we prove that is not a square, for all . Thus, for each , we deduce that
Step 4. For each , we show that there is an integer n such that
Now, we provide full details for the proofs of Theorems 3–5.
Proof of Theorem 3.
(i).
Step 1. We have and .
Step 2. For all , it is clear that and .
Step 3. We suppose that there is an integer such that is a square. Thus, we deduce that or . This identity is not possible, because is odd and is even. It is clear that cannot be a square. Similarly, it can be proved that is not a square. For all , we deduce that
and
Step 4. Considering that
the proof is finished.
(ii).
Step 1. We have , , and .
Step 2. For all , it is clear that , , and .
Step 3. We suppose that there is an integer such that is a square. Thus, we deduce that or . This identity is not possible, because is odd and is even. It is clear that cannot be a square. Similarly, it can be proved that , and are not squares. For and , we deduce that
Step 4. For , it is not difficult to check that is not congruent to 0 mod 4. In addition, for , we have . For , we see that is not congruent to 0 mod 4. The proof is finished. □
Proof of Theorem 4.
(i).
Step 1. We have .
Step 2. For all , it is clear that .
Step 3. We suppose that there is an integer such that is a square. Thus, we deduce that or . On the other hand,
It is clear that cannot be a square. For all , we deduce that
Step 4. Taking into account that
the proof is finished.
(ii).
Step 1. We have , , and .
Step 2. For all , it is clear that , , and .
Step 3. We suppose that there is an integer such that is a square. Thus, we deduce that or . This identity is not possible, because is odd and is even. It is clear that cannot be a square. Similarly, it can be proved that , and are not squares. For and , we deduce that
Step 4. For , it is not difficult to check that is not congruent to 0 mod 4. In addition, for , we have . For , we see that is not congruent to 0 mod 4. The proof is finished. □
Proof of Theorem 5.
(i).
Step 1. We have and .
Step 2. For all , it is clear that and .
Step 3. We suppose that there is an integer such that is a square. Thus, we deduce that or . This identity is not possible, because is odd and is even. It is clear that cannot be a square. Similarly, it can be proved that is not a square. For all , we deduce that
and
Step 4. For , it is not difficult to check that is congruent to 2 mod 4. The proof is finished.
(ii).
Step 1. We have and .
Step 2. For all , it is clear that and .
Step 3. We suppose that there is an integer such that is a square. Thus, we deduce that or . On the other hand,
It is clear that cannot be a square. Similarly, we suppose that there is an integer such that is a square. Thus, we deduce that or . Because , this identity is not possible. For and , we deduce that
Step 4. For , it is not difficult to check that is congruent to 2 mod 4. In addition, for , we have . For , we see that is congruent to 2 mod 4. The proof is finished. □
It seems that the approach outlined in Steps 1, 2 and 4 can be easily automated. Unfortunately, we cannot say the same about Step 3 because we do not have a criterion which establishes the parity of . Is the number always odd? When is an odd number, we need to investigate identities of the form
When is an even number, we need to investigate identities of the form
Can the investigation of these identities be automated? We do not have an answer to this question yet.
3. Some Ramanujan-Type Congruences
Let be a sequence of integers defined by
where M is a positive integer and are integers. Based on the ideas of Rademacher [22], Newman [23,24] and Kolberg [25], Radu [26] developed in 2009 an algorithm to verify the congruences
for any given m, t and u, and for all .
In 2015, Radu [27] constructed an algorithm, called the Ramanujan–Kolberg algorithm, to derive identities on the generating functions of using modular functions for . A description of the Ramanujan–Kolberg algorithm can be found in Paule and Radu [28]. Recently, Smoot [29] provided a successful Mathematica implementation of Radu’s algorithm. This package is called RaduRK.
In this section, we use the RaduRK package to obtain some Ramanujan-type congruences for the overpartition functions and . According to Theorems 2 and 3, we can write the following result.
Corollary 1.
For or , we have
Upon reflection, one expects that there might be a stronger result.
Theorem 6.
- (i)
- For all , we have
- (ii)
- For all , we have
Proof.
The generating function for can be written as
This can be described by setting and , , .
(i) Considering the RaduRK program with
and
we deduce that
and
(ii) To obtain the second congruence identity, we consider the RaduRK program with
and
We deduce that
and
Having
for , we notice that
and
This concludes the proof. □
According to Theorems 1, 2 and 4, we can write the following result.
Corollary 2.
For or , we have
There are stronger results.
Theorem 7.
- (i)
- For all , we have
- (ii)
- For all , we have
Proof.
(i) To obtain the first congruence identity, we consider the RaduRK program with
and obtain
(ii) To obtain the second congruence identity, we consider again the RaduRK program with
and
These give us
and
Having
for , we notice that
and
This concludes the proof. □
Theorem 8.
For all , we have
Proof.
To obtain this congruence identity, we consider the RaduRK program with
This gives us
Having
for , we notice that
and
Thus, for , we deduce that
This concludes the proof. □
According to Theorems 1 and 5, we can write the following result.
Corollary 3.
For or , we have
There are stronger results.
Theorem 9.
For all , we have
Proof.
To obtain this congruence identity, we consider the RaduRK program with
This gives us
□
4. Open Problems and Concluding Remarks
In this paper, we show that each odd prime generates four families of Ramanujan-type congruences modulo 4 for the number of divisors. Assuming Conjecture 1, the algorithm for generating is not difficult because must be a multiple of the odd prime p. Related to the case of Conjecture 4, we remark that there is a substantial amount of numerical evidence to conjecture the following.
Conjecture 5.
If n is an integer that is not the difference between a triangular number and a square number, then
We focused on the cases , where is the square of an odd prime. When is a multiple of the square of an odd prime, we can derive other pairs for which the statement (3) is true. For example, considering , we easily deduce that the statement (3) is true if
We remark that there are two pairs, and , which cannot be derived from the pairs or . In addition, we remark that
and
for all . The proof of these congruences follows easily if we consider that
for all . Moreover, and cannot be squares.
The study of congruences of the form
with , can be a very appealing topic. In analogy with (3), we can consider the following statement:
There is a substantial amount of numerical evidence to state the following generalization of Conjecture 1.
Conjecture 6.
If the statement (5) is true, then there is a sequence of odd prime numbers, , such that α is divisible by and is divisible by .
On the other hand, our investigations indicate that Conjecture 6 can be generalized if we consider congruences of the form
In analogy with (5), we can consider the following statement:
We state the following generalization of Conjecture 6.
Conjecture 7.
If the statement (6) is true, then there is a sequence of prime numbers, , such that α is divisible by and β is divisible by .
Because is a multiplicative function, these conjectures motivate the question of identifying all Ramanujan-type congruences for multiplicative functions.
Funding
This research received no external funding.
Institutional Review Board Statement
Not applicable.
Informed Consent Statement
Not applicable.
Data Availability Statement
Not applicable.
Conflicts of Interest
The author declares no conflict of interest.
References
- Corteel, S.; Lovejoy, J. Overpartitions. Trans. Amer. Math. Soc. 2004, 356, 1623–1635. [Google Scholar] [CrossRef] [Scilit]
- Chen, W.Y.C.; Sun, L.H.; Wang, R.-H.; Zhang, L. Ramanujan-type congruences for overpartitions modulo 5. J. Number Theory 2015, 148, 62–72. [Google Scholar] [CrossRef] [Scilit]
- Chen, W.Y.C.; Hou, Q.-H.; Sun, L.H.; Zhang, L. Ramanujan-type congruences for overpartitions modulo 16. J. Number Theory 2016, 40, 311–322. [Google Scholar] [CrossRef] [Scilit]
- Chern, S.; Dastidar, M.G. Some congruences modulo 5 and 25 for overpartitions. Ramanujan J. 2018, 47, 435–445. [Google Scholar] [CrossRef] [Scilit]
- Dou, D.Q.J.; Lin, B.L.S. New Ramanujan type congruences modulo 5 for overpartitions. Ramanujan J. 2017, 44, 401–410. [Google Scholar] [CrossRef] [Scilit]
- Fortin, J.-F.; Jacob, P.; Mathieu, P. Jagged partitions. Ramanujan J. 2005, 10, 215–235. [Google Scholar] [CrossRef] [Scilit]
- Hirschhorn, M.D.; Sellers, J.A. Arithmetic relations for overpartitions. J. Combin. Math. Combin. Comp. 2005, 53, 65–73. [Google Scholar]
- Kim, B. The overpartition function modulo 128. Integers 2008, 8, A38. [Google Scholar]
- Kim, B. A short note on the overpartition function. Discret. Math. 2009, 309, 2528–2532. [Google Scholar] [CrossRef] [Scilit]
- Lovejoy, J.; Osburn, R. Quadratic forms and four partition functions modulo 3. Integers 2011, 11, A4. [Google Scholar] [CrossRef] [Scilit]
- Mahlburg, K. The overpartition function modulo small powers of 2. Discrete Math. 2004, 286, 263–267. [Google Scholar] [CrossRef] [Scilit]
- Xia, E.X.W. Congruences modulo 9 and 27 for overpartitions. Ramanujan J. 2017, 42, 301–323. [Google Scholar] [CrossRef] [Scilit]
- Xiong, X. Overpartition function modulo 16 and some binary quadratic forms. Int. J. Number Theory 2016, 12, 1195–1208. [Google Scholar] [CrossRef] [Scilit]
- Yao, O.X.M.; Xia, E.X.W. New Ramanujan-like congruences modulo powers of 2 and 3 for overpartitions. Ramanujan J. 2013, 133, 1932–1949. [Google Scholar] [CrossRef] [Scilit]
- Merca, M. A further look at a complete characterization of Ramanujan-type congruences modulo 16 for overpartitions. Proc. Rom. Acad. Ser. A Math. Phys. Tech. Sci. Inf. Sci. 2019, 20, 329–335. [Google Scholar]
- Lebesgue, V.A. Sommation de quelques séeries. J. Math. Pure. Appl. 1840, 5, 42–71. [Google Scholar]
- Bessenrodt, C. On pairs of partitions with steadily decreasing parts. J. Combin. Theory Ser. A 2002, 99, 162–174. [Google Scholar] [CrossRef] [Scilit]
- Santos, J.P.O.; Sills, D. q-Pell sequences and two identities of VA Lebesgue. Discret. Math. 2002, 257, 125–142. [Google Scholar] [CrossRef] [Scilit]
- Chen, S.-C. On the number of overpartitions into odd parts. Discret. Math. 2014, 325, 32–37. [Google Scholar] [CrossRef] [Scilit]
- Hirschhorn, M.D.; Sellers, J.A. Arithmetic Properties of Overpartitions into Odd Parts. Ann. Comb. 2006, 10, 353–367. [Google Scholar] [CrossRef] [Scilit]
- Merca, M. On the Ramanujan-type congruences modulo 8 for the overpartitions into odd parts. Quaest. Math. 2021. Available online: https://www.tandfonline.com/doi/abs/10.2989/16073606.2021.1966543 (accessed on 1 July 2022).
- Rademacher, H. The Ramanujan identities under modular substitutions. Trans. Amer. Math. Soc. 1942, 51, 609–636. [Google Scholar] [CrossRef] [Scilit]
- Newman, M. Construction and application of a class of modular functions. Proc. Lond. Math. Soc. 1957, 7, 334–350. [Google Scholar] [CrossRef] [Scilit]
- Newman, M. Construction and application of a class of modular functions (II). Proc. Lond. Math. Soc. 1957, 9, 373–387. [Google Scholar] [CrossRef] [Scilit]
- Kolberg, O. Some identities involving the partition function. Math. Scand. 1957, 5, 77–92. [Google Scholar] [CrossRef] [Scilit]
- Radu, S. An algorithmic approach to Ramanujan’s congruences. Ramanujan J. 2009, 20, 215–251. [Google Scholar] [CrossRef] [Scilit]
- Radu, C.-S. An algorithmic approach to Ramanujan-Kolberg identities. J. Symb. Comput. 2015, 68, 225–253. [Google Scholar] [CrossRef] [Scilit]
- Paule, P.; Radu, C.-S. Partition analysis, modular functions, and computer algebra. In Recent Trends in Combinatorics; Beveridge, A., Griggs, J.R., Hogben, L., Musiker, G., Tetali, P., Eds.; Springer: Cham, Germany, 2016; pp. 511–543. [Google Scholar]
- Smoot, N.A. On the computation of identities relating partition numbers in arithmetic progressions with eta quotients: An implementation of Radu’s algorithm. J. Symb. Comput. 2021, 104, 276–311. [Google Scholar] [CrossRef] [Scilit]
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations. |
© 2022 by the author. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (https://creativecommons.org/licenses/by/4.0/).