- Research
- Open access
- Published:
Bernoulli numbers, convolution sums and congruences of coefficients for certain generating functions
Journal of Inequalities and Applications volume 2013, Article number: 225 (2013)
Abstract
In this paper, we study the convolution sums involving restricted divisor functions, their generalizations, their relations to Bernoulli numbers, and some interesting applications.
MSC: 11B68, 11A25, 11A67, 11Y70, 33E99.
1 Introduction
The Bernoulli polynomials , which are usually defined by the exponential generating function
play an important role in different areas of mathematics, including number theory and the theory of finite differences. The Bernoulli polynomials satisfy the following well-known identities :
and
We set . It is obvious from the way the polynomials are constructed that all the are rational numbers. It can be shown that for , and is alternatively positive and negative for even k. The are called Bernoulli numbers.
Throughout the paper, we use the following arithmetical functions and q-series (sometimes defined by product expressions). For any integer , , we define
For with , we consider the q-series:
The exact evaluation of the basic convolution sum
first appeared in a letter from Besge to Liouville in 1862. The evaluation of such sums also appear in the works of Glaisher, Lahiri, Lehmer, Ramanujan, and Skoruppa. For instance, Ramanujan [1] obtained
using only elementary arguments. For , Ramanujan showed that the sum
can be evaluated in terms of the quantities
for the nine pairs satisfying
For explicit evaluations of for different pairs satisfying the above conditions stated, we refer to the papers of Ramanujan [1], [2], Huard et al. [3], Lahiri [4], and Glaisher [5], respectively. Levit [6] showed that the nine arithmetic evaluations of (with a, b both odd) are the only ones using the theory of modular forms. In [4], Lahiri has given 37 sums of the form
where , , each of which can be expressed as a finite linear combination of with coefficients which are polynomials in N of degree at most with rational coefficients.
In 2002, Huard et al. [3] extended Melfi’s [7] result to
where N is an arbitrary positive integer.
Glaisher [5, 8, 9] extended Besge’s formula by replacing in the convolution sum in (1) by other arithmetical functions; for example, he obtained
and
Recently, Hahn [10] showed that
It is also interesting to note that the arithmetical functions (for example, and ), coming out as coefficients of the q-series expansion of its corresponding q-products, do appear in the explicit evaluation of certain convolution sums. For instance, Lahiri (see [11]) proved that
and from Alaca and Williams (see [12]), we observe that
In [13], Simsek (and also in [[14], (2.17)] Simsek along with Ozden and Cagul) has studied other aspects of the arithmetical function in connection with the classical Jacobi and Euler functions. We also refer to Kim and Lee [[15], Lemma 2.1] and [16].
Thus the study of convolution sums and their applications is classical and they play an important role in number theory. The aim of this article is to first extend and generalize Glaishers formulas (stated in (3) and (4)). We indeed study the sums (in Section 3)
Then, we study and evaluate (in Section 4) sums of the type
As applications to our study and evaluations of convolution sums, we show that , , and are connected by a second-order differential equation (see Theorem 3.8).
In Section 5, we also prove some interesting congruence relations involving the coefficients of modular-like functions and divisor functions (see Theorem 5.3). As a sample, we obtain that if , then the congruence
holds.
In Section 6, we present a generalization of Besge’s formula by considering certain combinatorial convolution sums (see Theorem 6.3). It should be noted that Proposition 6.1, Theorem 6.3, and Remark 6.4 exhibit amply the connection between the convolution sums and the Bernoulli numbers. Finally, we record special values of , , , , and (for ) and some convolution formulas in the Appendix.
2 Some weighted convolution sums
Let . It is easily checked that
Lemma 2.1 For and , we have
Proof We observe that
Hence
and thus
□
Lemma 2.2 For and , we have
Proof We note that
Then, for the second term on the right-hand side of (6), we replace k by in Lemma 2.1 and obtain
This shows that
So, (6) can be written as
Here the left-hand side of (7) is
Therefore we have
This completes the proof. □
Remark 2.3 In general, we can express
as a combination in terms of the sum
with their coefficients being polynomials in N of degree at most .
Lemma 2.4 For and , we have
Proof We note that (for ),
Observing the fact that
for any , we obtain
This proves Lemma 2.4. □
Remark 2.5 By iteration process, in principle, the convolution sum can be evaluated for any odd .
Let
Lemma 2.6 For and . Then we have
Proof From the cyclic transformation, , we observe that
Therefore, we have
Now Lemma 2.6 follows. □
Lemma 2.7 For and . Then we have (with for all )
Proof As in Lemma 2.6, again by the cyclic transformation , we observe that
and
Therefore, we get (from (8) and (9))
where for all . This proves Lemma 2.7. □
3 The convolution sum and its extensions
Proposition 3.1 (a) [[17], Theorem 15.1, p.184], we have
(b) [[3], Theorem 3], [[17], Theorem 15.3, p.188], we have
Proposition 3.2 Let . Then we obtain
In particular, we have
which can also be seen in [[17], p.27].
Proof We can know that
□
Proposition 3.3 Let N be any positive integer. For , where , we have
Proof For the sake of completeness, we just hint the proof of (b). We note that . Since is a -scalar multiplicative function (i.e., ), we have
by (4). The proofs of (a), (c), and (d) are similar to (b). □
Remark 3.4 Using Eq. (3) and Lemma 2.1, we obtain
Theorem 3.5 Let N (≥3) be any integer with . Then we have
Proof Let and for some and prime p. Since p does not divide , we can write for some . Therefore, we have
We note that
and hence, we use Eq. (1) and Eq. (10) to obtain the result. □
Corollary 3.6 Let
where is an odd prime. Then
where the coefficients a, b, c, d are listed in Table 1.
Remark 3.7 If is any odd prime, then
from Table 2.
Now, we compare the values of the convolution sums in Table 3 [[17], p.148]. For almost all , we find that and (Figure 1). As an application to Theorem 3.5, we have the following.
Theorem 3.8 The q-series , , are connected by the differential equation,
where and .
Proof We note that
from Theorem 3.5. We note that is zero for and . Thus the differential Eq. (12) follows. □
Remark 3.9 We also note that from Eq. (1) and Eq. (3), we can determine the equations
and
From (14) and (15), Eq. (12) can also be deduced. Using [[18], (28)] and (15), we also get
where
and ( the complex upper-half plane) is a lattice and .
4 The convolution sum and its extensions
Theorem 4.1 Let N be a positive integer. And let . Then we have
Proof From Proposition 3.2 and Eq. (11), we can deduce that
Now, we note that
Therefore, the theorem follows from Eq. (1) and Proposition 3.1(b). □
Theorem 4.2 Let N be a positive integer and let . Then we have
Proof We note that
Now, the theorem follows from (1), Proposition 3.1(a), (b), and Eq. (5). □
Remark 4.3 We can compare the two sums
as follows (see Table 4). Here we find the formula for the sum in a similar way as in Theorem 4.2 (see [[16], Theorem 2.5]).
5 Congruence relations of coefficients of certain modular-like functions
Lemma 5.1 Let . Then we have Table 5.
Proof We use Table 15 in the Appendix, and the proof of Lemma 5.1 is now similar to the proof of Theorem 4.1. □
Remark 5.2 It is easy to observe that
when N is odd.
As an application to the explicit evaluation of convolution sums, using Table 5 we prove the following theorem.
Theorem 5.3 If N is odd, then
(a) . In particular , we have .
(b) . In particular , we have .
(c) . In particular , we have .
Proof Since the proofs of (a), (b), and (c) are similar, we only prove (c). When N is odd, from Table 5, we see that
Since N is odd, , and hence either k is even or is even. Then, by (11), or . So, in general,
In particular, for , we have Table 6 and
If , then there exists a prime satisfying and . Thus
Therefore, we obtain
Arguing in a similar manner as in (18), we get
and
Therefore, we obtain
Using , (18), and Table 6, we get
and
Therefore, by (16), (20), and (21), we have
□
Remark 5.4 The same result (c) of Theorem 5.3 has been obtained by Lahiri by a different approach considering the Eisenstein series and so on (see [[4], (11.1)-(11.40)], [[19], p.28]).
Corollary 5.5 Suppose that is a prime number with . Then for .
Proof Using Mathematica 8.0, we first find b with satisfying . Then if is a prime number, then we find that by Theorem 5.3 (c), using Mathematica 8.0,
except for . Thus the corollary follows. □
Example 5.6 Some values of , , , , and are listed in Table 7.
Corollary 5.7 Let . Then we have Table 8.
In particular, if N is odd, then we have Table 9.
Proof Since the proofs for the convolution sums are similar, we only prove . We write as follows:
by (11). Also since and are odd, we find that
So, we obtain the formula for by (22) and Table 5. In particular, if N is odd, then , because is multiplicative. Therefore the proof is complete. □
By eliminating , , and in Table 5, we can obtain the following example.
Example 5.8 Let . Then for , we have
For , we refer to Eq. (1).
Now we present some convolution formulas in Table 10.
6 Certain combinatorial convolution sum
The four basic theta functions are defined below following the notation of Whittaker and Watson [[20], p.464]. Let be such that . Set so that . For , we define (as in [17])
Jacobi (see [21, 22]) proved that
and
From (23) and (24), we deduce that
Equating coefficients of () on the left- and right-hand sides of (25) (see [[17], p.16]), then we obtain the arithmetical equality involving the trigonometric functions
If we expand each cosine in powers of z using
and equate coefficients of (), then we obtain
A generalized Besge formula due to Liouville is as follows.
Proposition 6.1 (See [[17], Theorem 12.3])
Let and , where . Then we have
where is the 2jth Bernoulli number.
Let . Now we prove the following lemma.
Lemma 6.2 We have
Proof First we consider
Now the right-hand side of (27) is
by (11). Therefore we obtain
□
As a consequence of Proposition 6.1 and Lemma 6.2, we have the following.
Theorem 6.3
where is the 2jth Bernoulli number.
Proof From Proposition 6.1, we get
by replacing . From Lemma 6.2 we know that
By subtracting (29) from (28), the theorem follows. □
Remark 6.4 It is well known that
In Proposition 6.1, taking , we obtain
and this implies the well-known identity involving the Bernoulli numbers
In Theorem 6.3, taking , we obtain
Then we have
Using (30) and (31), we get
and hence again we obtain a more general relation between Bernoulli numbers and the Faulhaber sum
See, for example, [23].
Appendix
The values of , , , , and (for ()) are given in Tables 11, 12, 13, 14, and 15 respectively. We first write the corresponding product expression into a q-series sum of a finite number of terms (i.e., q-series sum of N number of terms) with an error which tends to zero as . Then we use Mathematica 8.0 to compare the corresponding coefficients up to .
Evaluation of certain convolution sums: We have Table 16.
References
Ramanujan S: On certain arithmetical functions. Trans. Cambridge Philos. Soc. 1916, 22: 159–184.
Ramanujan S: Collected Papers. Am. Math. Soc., Providence; 2000.
Huard JG, Ou ZM, Spearman BK, Williams KS: Elementary evaluation of certain convolution sums involving divisor functions.II. Number Theory for the Millennium 2002, 229–274.
Lahiri DB:On Ramanujan’s function and the divisor function , I. Bull. Calcutta Math. Soc. 1946, 38: 193–206.
Glaisher JWL: On certain sums of products of quantities depending upon the divisors of a number. Mess. Math. 1885, 15: 1–20.
Levitt, J: On a Problem of Ramanujan. M. Phil thesis, University of Nottingham (1978)
Melfi G: On Some Modular Identities, Number Theory. de Gruyter, Berlin; 1998:371–382.
Glaisher JWL: On the square of the series in which the coefficients are the sums of the divisors of the exponents. Mess. Math. 1884, 14: 156–163.
Glaisher JWL: Expressions for the five powers of the series in which the coefficients are the sums of the divisors of the exponents. Mess. Math. 1885, 15: 33–36.
Hahn H: Convolution sums of some functions on divisors. Rocky Mt. J. Math. 2007, 37: 1593–1622. 10.1216/rmjm/1194275937
Lahiri DB:On Ramanujan’s function and the divisor function , II. Bull. Calcutta Math. Soc. 1947, 39: 33–52.
Alaca S, Williams KS:Evaluation of the convolution sums and . J. Number Theory 2007, 124: 491–510. 10.1016/j.jnt.2006.10.004
Simsek Y: Elliptic analogue of the Hardy sums related to elliptic Bernoulli functions. Gen. Math. 2007, 15: 3–23.
Ozden H, Cangul IN, Simsek Y: Multivariate interpolation functions of higher-order q -Euler numbers and their applications. Abstr. Appl. Anal. 2008., 2008: Article ID 390857
Kim M-S, Lee JH: On sums of the extended q -Euler numbers. J. Math. Anal. Appl. 2013, 397: 522–528. 10.1016/j.jmaa.2012.07.067
Kim A, Kim D, Seo G:Convolution sum . Honam Math. J. 2012, 34: 519–531. 10.5831/HMJ.2012.34.4.519
Williams KS London Mathematical Society Student Texts 76. In Number Theory in the Spirit of Liouville. Cambridge University Press, Cambridge; 2011.
Kim D, Kim A, Park H:Congruences of the Weierstrass and ()-functions on divisors. Bull. Korean Math. Soc. 2013, 50: 241–261.
Berndt, BC, Ono, K: Ramanujan’s unpublished manuscript on the partition and tau functions with proofs and commentary. Lotharingien de Combinatoire, vol. 42, 63 pp. (1999)
Whittaker ET, Watson GN: A Course of Modern Analysis. Cambridge University Press, Cambridge; 1963.
Jacobi, CGJ: Fundamenta Nova Theoriae Functionum Ellipticarum. Sumptibus Fratrum Bornträger; reprinted in C. G. J. Jacobi, Gesammelte Werke, vol. 1, pp. 49–239. Reimer, Berlin (1881–1891)
Jacobi CGJ I-VIII. In Gesammelte Werke. Chelsea, New York; 1969.
http://en.wikipedia.org/wiki/Bernoulli_number
Cheng N, Williams KS: Evaluation of some convolution sums involving the sum of divisors functions. Yokohama Math. J. 2005, 52: 39–57.
Acknowledgements
The author AS wishes to thank the National Institute for Mathematical Sciences (NIMS), Daejeon, Republic of Korea for its warm hospitality and generous support.
Author information
Authors and Affiliations
Corresponding author
Additional information
Competing interests
The authors declare that they have no competing interests.
Authors’ contributions
All authors contributed equally to the manuscript and typed, read and approved the final manuscript.
Authors’ original submitted files for images
Below are the links to the authors’ original submitted files for images.
Rights and permissions
Open Access This article is distributed under the terms of the Creative Commons Attribution 2.0 International License (https://creativecommons.org/licenses/by/2.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
About this article
Cite this article
Kim, D., Kim, A. & Sankaranarayanan, A. Bernoulli numbers, convolution sums and congruences of coefficients for certain generating functions. J Inequal Appl 2013, 225 (2013). https://doi.org/10.1186/1029-242X-2013-225
Received:
Accepted:
Published:
DOI: https://doi.org/10.1186/1029-242X-2013-225