Keywords: Divisor function; exponential sum; double large sieve.
MR(2020) Subject Classification: 11L07, 11L20, 11N37.
On a sum of the error term of the Dirichlet divisor function over primes
Abstract.
Let be the Dirichlet divisor function and denote the error term of the sum for a large real variable . In this paper we focus on the sum , where runs over primes. We prove that there exists an asymptotic formula.
1. Introduction and Main Result
Let be the Dirichlet divisor function and denote the error term of the sum for a large real variable . It was first proved by Dirichlet that . Over the years the exponent was improved by many authors[7, 13, 19, 20]. Until now the best result
(1.1) |
was given by Huxley[8].
It is conjectured that , which is supported by the classical mean square result
(1.2) |
for a large real number , and where
is a constant. It was proved by Cramér[1] in 1922. The result was improved by Tong[17] in 1956, Preissmann[15] in 1988, and Lau and Tsang[14] in 2009.
Also, the discrete mean values
have been investigated by various authors. Define the continuous mean values
Many authors found that the discrete and the continuous mean value formulas are connected deeply with each other and studied the difference between and . Hardy[4] studied the difference between and and derived that . These differences were also studied by Furuya [3], he gave the asymptotic formula
In this paper, as an analogue of the discrete mean values, we consider a sum of over a subset of . More precisely over primes, namely , where runs over primes and is a large real variable. And the result is stated as follows:
Theorem.
2. Priliminary
2.1. Notations
Throught this paper, denotes a sufficiently small positive number, not necessarily the same at each occurrence. Let always denote a prime number. As usual, and denote the Dirichlet divisor function, the von Mangoldt function and the Möbius function, respectively, denotes the set of complex numbers, denotes the set of real numbers, and denotes the set of natural numbers. We write . The notation means , means ; means . denotes the greatest common divisor of ().
2.2. Auxiliary Lemmas
We need the following lemmas.
Lemma 2.1.
For real numbers and satisfying , we have
where
and satisfies:
(i) .
(ii) For any fixed real number , we have
Lemma 2.2.
Let be a real number and be an integer. Then for any , there holds
(2.1) |
Proof.
See the argument on pp.1366-1367 of Heath-Brown[5]. ∎
Lemma 2.3.
Let , be two finite sequence of real numbers with
and . Defining the bilinear forms
then we have
with
and defined similarly.
Proof.
See Proposition 1 of Fouvry and Iwaniec[2]. ∎
Lemma 2.4.
Let and be two finite sequences of real numbers and let be a real number. Then we have
Proof.
See the argument of P266-267 in Zhai[22]. ∎
Lemma 2.5.
Let be a fixed real integer. For any integer and any real number , we define as being the number of quadruplets
which satisfy the inequality
then we have
where the implied constant depends only on .
Proof.
See the argument on Theorem 2 of Robert and Sargos[16]. ∎
Lemma 2.6.
Let be a given large integer, be a real number and denote the set . Suppose
then we have
Proof.
See Lemma 2 of Iwaniec and Sárközy[11]. ∎
Lemma 2.7.
Let are fixed real numbers and . Suppose is a real function with and on . We then have
Proof.
See Lemma 8.8 of Iwaniec and Kowalski[10]. ∎
Lemma 2.8.
Let be a real differentiable function such that is monotonic and for . Then
Proof.
See Lemma 2.1 of Ivić[9]. ∎
Lemma 2.9.
Suppose that has continuous derivatives of arbitrary order on , where . Suppose further that we have
Then
(2.2) |
Proof.
Lemma 2.10.
Let be a large real number and be a real number such that . We have
Proof.
See Heath-Brown and Tsang[6]. ∎
Lemma 2.11.
Suppose are given real numbers, are real numbers such that . Define
Then we have
Proof.
We state a multiple exponential sums of the following form:
(2.5) |
with and are given real numbers, such that . It is called a ”Type I” sum, denoted by , if or ; otherwise it is called a ”Type II” sum, denoted by .
Lemma 2.12.
Suppose that , or , . Then if , there holds
Proof.
In order to separate the dependence from the range of summation we appeal to the following formula
Lemma 2.13.
Let and let be complex numbers with . We then have
where the constant implied in depends on only.
Proof.
See Lemma 6 of Fouvry and Iwaniec[2]. ∎
Lemma 2.14.
Suppose with , , . Then for , there holds
3. The spacing problem
Let , . In this section is a small real positive number. In this section we investigate the distributions of real numbers of type
with , , , , .
Let denote the number of sixturplets with , , satisfying
(3.1) |
Our aim is to prove the following:
Proposition 3.1.
We have
(3.2) | ||||
Proof.
Suppose are fixed, without loss of generality we assume that and . We denote the number of solutions of
(3.3) |
by . Let be the number of solutions of to (3.3) which additionally satisfying .
We divide the solutions of , into classes each one having fixed values , the points are spaced by , where is a constant. Then
4. Proof of the Theorem
We are first going to estimate . Using notations in Lemma 2.1, let be a real number such that , one has
(4.1) |
denoted by , respectively.
For , one has
The latter term can be transformed into , where
For , by the expression of and Lagrange’s mean value theorem we obtain , and by Lemma 2.1 we have , thus
For , one has
where we use Lemma 2.10. Thus we conclude that
(4.2) |
Next we turn to evaluate . Using we have
(4.3) | ||||
where
4.1. Estimate of
One can see can be written as linear combination of sums of the form
by using , and where . Since are symmetric in the above sum, we are just going to estimate
Trivially we have
(4.4) |
where
It follows from partial summation that
(4.5) | ||||
where
Moreover, we easily obtain
By a splitting argument we only need to give the upper bound estimate of the following sum
(4.6) |
After using Heath-Brown’s identity, i.e. Lemma 2.2 with , one can see that (4.6) can be written as linear combination of sums, each of which is of the form
(4.7) | ||||
where ; , and some may only take value . Therefore, it is sufficient for us to estimate for each defined as in (4.7). Next, we will consider four cases.
Case 1
If there exists an such that , then we must have for the fact that
Case 2
If there exists an such that , then we take
Thus, is a sum of ”Type II” satisfying . By Lemma 2.14, we have
Case 3
If there exists an such that , then we take
Thus, is a sum of ”Type II” satisfying . By Lemma 2.14, we have
Case 4
If , without loss of generality, we assume that
4.2. Estimate of
By the same argument on , we derive that
(4.9) |
where
(4.10) |
Using Lemma 2.7, Lemma 2.8 and the Cauchy-Schwarz’s inequality, one has
which combined with (4.10) yields
(4.11) | ||||
Above all, since run over , , by (4.3), (4.8), (4.11), after eliminating lower order terms, we conclude that
(4.12) | ||||
where we use the partial summation and denotes .
It remains to estimate , suppose , then by (4.2), (4.12) and the Cauchy-Schwarz’s inequality we have
(4.13) |
Since , combining (4.1), (4.2), (4.12), (4.13), taking , we obtain
Thus replacing by , , and so on, and adding up all the results, we obtain
(4.14) |
Thus we have completed the proof of the Theorem.
Acknowledgement
The authors would like to appreciate the referee for his/her patience in refereeing this paper. This work is supported by the Beijing Natural Science Foundation(Grant No.1242003), and the National Natural Science Foundation of China (Grant No.11971476).
References
- [1] Harald Cramér. Über zwei Sätze des Herrn G. H. Hardy. Math. Z., 15(1):201–210, 1922.
- [2] Étienne Fouvry and Henryk Iwaniec. Exponential sums with monomials. J. Number Theory, 33(3):311–333, 1989.
- [3] Jun Furuya. On the average orders of the error term in the Dirichlet divisor problem. J. Number Theory, 115(1):1–26, 2005.
- [4] G. H. Hardy. The Average Order of the Arithmetical Functions P(x) and delta(x). Proc. London Math. Soc. (2), 15:192–213, 1916.
- [5] D. R. Heath-Brown. Prime numbers in short intervals and a generalized Vaughan identity. Canadian J. Math., 34(6):1365–1377, 1982.
- [6] D. R. Heath-Brown and K. Tsang. Sign changes of , , and . J. Number Theory, 49(1):73–83, 1994.
- [7] M. N. Huxley. Exponential sums and lattice points. II. Proc. London Math. Soc. (3), 66(2):279–301, 1993.
- [8] M. N. Huxley. Exponential sums and lattice points. III. Proc. London Math. Soc. (3), 87(3):591–609, 2003.
- [9] Aleksandar Ivić. The Riemann zeta-function. A Wiley-Interscience Publication. John Wiley & Sons, Inc., New York, 1985. The theory of the Riemann zeta-function with applications.
- [10] Henryk Iwaniec and Emmanuel Kowalski. Analytic number theory, volume 53 of American Mathematical Society Colloquium Publications. American Mathematical Society, Providence, RI, 2004.
- [11] Henryk Iwaniec and András Sárközy. On a multiplicative hybrid problem. J. Number Theory, 26(1):89–95, 1987.
- [12] Anatolij A. Karatsuba. Basic analytic number theory. Springer-Verlag, Berlin, russian edition, 1993.
- [13] G. Kolesnik. On the order of and . Pacific J. Math., 98(1):107–122, 1982.
- [14] Yuk-Kam Lau and Kai-Man Tsang. On the mean square formula of the error term in the Dirichlet divisor problem. Math. Proc. Cambridge Philos. Soc., 146(2):277–287, 2009.
- [15] Emmanuel Preissmann. Sur la moyenne quadratique du terme de reste du problème du cercle. C. R. Acad. Sci. Paris Sér. I Math., 306(4):151–154, 1988.
- [16] O. Robert and P. Sargos. Three-dimensional exponential sums with monomials. J. Reine Angew. Math., 591:1–20, 2006.
- [17] Kwang-Chang Tong. On divisor problems. II, III. Acta Math. Sinica, 6:139–152, 515–541, 1956.
- [18] Kai Man Tsang. Higher-power moments of and . Proc. London Math. Soc. (3), 65(1):65–84, 1992.
- [19] J. G. van der Corput. Zum Teilerproblem. Math. Ann., 98(1):697–716, 1928.
- [20] Georges Voronoï. Sur une fonction transcendante et ses applications à la sommation de quelques séries. Ann. Sci. École Norm. Sup. (3), 21:207–267, 1904.
- [21] Wenguang Zhai. On higher-power moments of . II. Acta Arith., 114(1):35–54, 2004.
- [22] Wenguang Zhai. On higher-power moments of . III. Acta Arith., 118(3):263–281, 2005.