Abstract
Let x be a large real number, be the Dirichlet divisor function and . In this paper, we consider a weighted form of the three primes theorem: where run over primes, , and N is an large odd integer. For the case , the others two with , an asymptotic formula for has been derived, along with a non-trivial upper bound estimate for when .
PACS:
11L07; 11L20; 11P32; 11N37
1. Introduction
The general divisor problem is to study the asymptotic behavior of the well known sum
as x tends to infinity, where is the Euler’s constant and is the “error term”. It was first proved by Dirichlet that . Furthermore, the exponent was improved by many authors [,,,]. Until now, the best result, that is
was given by Huxley []. It is conjectured that
holds for any , which is supported by the classical mean-square result
proved by Lau and Tsang [], where is a positive constant which can be written down explicitly by the Riemann zeta-function , and the upper bound estimate
where is a real number. The estimate of type (5) can be found in Ivić [] with . In this paper, we use Huxley’s result (2) and Ivić’s [] method to obtain that we can take (similar to Lemma 8 in this paper).
For any integer , we have derived the asymptotic formula of unified form
where and are explicit constants. The exact value of was studied by many authors [,,,,,,].
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 [,,,,].
As analogues of the discrete mean values, we can consider the sum of over a subset of . For example, the sum over primes, namely
for integer . The authors [,] have proved that, for , (9) has the asymptotic formula
where and are computable constants.
Vinogradov [] proved that, for every sufficiently large odd integer N, the equation
is solvable for prime numbers . More precisely, he proved the asymptotic formula
where is the singular series
Formula (12) is called the three primes theorem, or Vinogradov–Goldbach theorem.
2. Main Result
In this paper, we consider the sum of over primes in arithmetic progression, namely
where is an integer, , . Furthermore, we consider an exponential sum connected with , namely
We obtain asymtotic formula for (14) and an upper bound estimate for (15). These results enable us to prove an analogue of Vinogradov’s three primes theorem with coefficients . for , i.e., the asymptotic formula of
Then, we have the following theorems.
Theorem 1.
Theorem 2.
If there exists for , then
By Theorem 1, Equation (12), and the Cauchy–Schwarz’s inequality, we obtain that the trivial upper bound for the case in Theorem 2 is
and thus, Theorem 2 gives a non-trivial upper bound.
Notations
Throughout this paper, N is a large positive odd number and denotes a sufficiently small positive number, not necessarily the same at each occurrence. Let p, with or without subscripts, always denote a prime number. As usual, , , , and denote the Dirichlet divisor function, the von Mangoldt function, the Möbius function, and the Euler totient 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 .
3. The Circle Method
For , and , define
By the definition of and the well-known identity
we have
for any .
In order to compute the integral, we choose two parameters Q and as follows:
with real, and .
For any with , define
We call the and the .
We then have
where
The problem is now reduced to evaluating and giving an upper bound of .
4. Additional Lemmas
In this section, we present some lemmas.
Lemma 1.
For , , we have
where denotes the distance from α to the nearest integer.
Proof.
The proof of this Lemma has been found to be (8.6) in Iwaniec and kowalski []. □
Lemma 2.
Let be a real number and be an integer. Then, for any , it holds that
Proof.
See the argument on pp. 1366–1367 of Heath-Brown []. □
Lemma 3.
Suppose that
where , , , and are positive. Assume further that . Then there exists some with and
The implied constant depends only on m and n.
Proof.
See Lemma 3 of Srinivasan []. □
Lemma 4.
For an fixed integer , let are integers, such that
then
Proof.
See Lemma 2.2 of Zhai []. □
Lemma 5.
Suppose is a fixed integer, is a large parameter. Define
Then, we have
(i) is convergent.
(ii)
Proof.
See Lemma 3.1 of Zhai []. □
Lemma 6.
Suppose are given real numbers, are real numbers such that , . Define
Then, we have
Proof.
See Lemma 2.11 of []. □
Lemma 7.
Suppose that has continuous derivatives of arbitrary order on , where . Suppose further that for either or 2 we have
Then
Proof.
See Lemma 2.1 of Graham and Kolesnik []. □
Lemma 8.
For any fixed real number and a large real number x, we have the estimate
Proof.
See Lemma 2.11 of []. □
Lemma 9.
For real numbers N and x satisfying , we define
Then, uniformly for , we have
Proof.
See Lemma 2.12 of the authors []. □
Lemma 10.
For real numbers N and x satisfying , we define
We have
We also have, for ,
Moreover, if , then for any fixed real number we have the estimate
Proof.
See Lemma 2.13 of the authors []. □
For real number and fixed integer , we state a multiple exponential sums of the following form:
with fixed, , , and are given real numbers, such that , , and are given in Lemma 4. In this sum, without loss of generality we assume . It is called a “Type I” sum, denoted by , if or ; otherwise, it is called a “Type II” sum, denoted by .
Lemma 11.
Suppose that , or , . Then for , it holds that
Proof.
Set . It is easy to see that
If , then by Lemma 7, we deduce that
For , by Lemma 4 we have
For , when , by Lemma 6 we have
when , it is easier to get the same estimate by using , we omit the details.
When , , we can easily obtain
Lemma 12.
Suppose with , , . Then for , it holds that
Proof.
Let Y, which satisfies , be a parameter which will be chosen later. By the Weyl–van der Corput inequality (see Lemma 2.5 of Graham and Kolesnik []), we have
where
with
It is easy to see that
By (39) of Lemma 7, we have
Putting (59) into (55), we derive that
By noting that , it follows from Lemma 3 that there exists an optimal Y such that
which implies
Therefore, from the above estimate and the condition , we obtain
using Lemma 4, for we have
For , when , by Lemma 6 and the condition we derive that
For the case , we can use the similar argument in Lemma 11. When , , we obtain
Thus, combining (64)–(66), we complete the proof. □
5. Asymptotic Formula for
Suppose with , , . Without loss of generality, we only consider , and for convenience we set . For , we have
where we use and the trivial estimate .
By partial summation we have
We are going to evaluate
5.1. Asymptotic Formula for
Using the notations in Lemmas 9 and 10, let M be a real number such that ; thus, we have
where
Next, we turn to evaluate . Using , we have
where
We divide the into two parts:
where
First, we consider the contribution of . For the inner sum, by partial summation and Siegel–Walfisz theorem, we have
where are constants.
Using a similar argument on (4.1)–(4.4) as made by Zhai [], we obtain
where
Next, we consider the contribution of . One can see can be written as a linear combination of sums of the form
where we use , and where . Without loss of generality, we assume that . By a splitting argument we only need to estimate
Trivially we have
where
It follows from partial summation that
where
Moreover, by the definition of , we easily obtain
It is known that
we can represent the innermost sum in (88) as
From (88) and (90), we know that it suffices to estimate
After using Heath-Brown’s identity, i.e., Lemma 2 with , one can see that the exponential sum
can be written as linear combination of sums, each of which is of the form
where ; , and some may only take value 1. Therefore, it is sufficient for us to estimate for each defined as in (93). Next, we will consider four cases.
5.1.1. Case 1
If there exists an such that , then we must have for the fact that with . Let
In this case, we can see that is a sum of “Type I” satisfying . By Lemma 11, we have
5.1.2. Case 2
If there exists an such that , then we take
Thus, is a sum of “Type II” satisfying . By Lemma 12, we have
5.1.3. Case 3
If there exists an such that , then we take
Thus, is a sum of "Type II" satisfying . By Lemma 12, we have
5.1.4. Case 4
If , without loss of generality, we assume that . Let ℓ denote the natural number j such that
Since and , then . Thus, we have
5.2. Asymptotic Formula for
Since , and are symmetric in , without loss of generality, we will only evaluate .
Lemma 13.
Proof.
□
Then, we turn to evaluate .
Lemma 14.
For , we have
where is defined in, Γ is the Euler Gamma function, and are constants defined by
Proof.
By Equation (109), Lemma 112, and using the trival estimate , we derive that
where is a constant. Then, we have
where is a constant.
Define
Next, for , we have
and thus
Therefore, we get
where we use the trivial estimate . Hence, one has
By Lemma 1 and partial summation, we derive that
which implies that
Therefore, we have
On the other hand, we get
which implies
We have
thus
and without loss of generality, we derive that
Noting the fact that
and
using the Cauchy–Schwarz’s inequality, we deduce that
And then we have
Using partial summation and Theorem 3.6 in Karatsuba [], we derive that
6. Upper Bound Estimate for
Since , , are symmetric, without loss of generality, we assume , then
Using Cauchy–Schwarz’s inequality, we derive that
provided that and , where we use Equation (10). Then, in order to prove the theorem, we need to show
For , using partial summation, we obtain
where is a constant. For with , and , , and thus, we obtain
by using the first derivative test (see (2.3) of Ivić []). If , Equation (141) holds, and hence
7. Proof of Theorem 2
We are going to give the upper bound for when . We have
For , by Equation (45) and Cauchy–Schwarz’s inequality,
holds for .
In order to estimate , by Lemma 9 and the similar argument in Section 5.1, it is sufficient to estimate
where ; , and some may only take value 1, . Furthermore, using Lemmas 11 and 12 of the condition , similar to the four cases in Section 4, we have
Take , combining Equations (145), (146) and (148) we obtain
Thus, if there exists such that (without loss of generality we take ), then
By Equation (140) we obtain
Thus, we have completed the proof of Theorem 2.
8. Conclusions
This article gives an analogue of the three primes theorem, which is weighted by . The methods in this paper can be used for further research. For example, the three primes theorem weighted by the error term of the sum of other arithmetic functions may only need to give new estimate for the exponential sum generated by new error terms. Moreover, it may be used in other problems which should use the circle method.
Funding
This work is supported by the Natural Science Foundation of Beijing Municipal (Grant No.1242003) and the National Natural Science Foundation of China (Grant No.12471009).
Acknowledgments
The authors would like to appreciate the peer reviewer for their patience in reviewing this paper.
Conflicts of Interest
The author declares no conflicts of interest.
References
- Huxley, M.N. Exponential sums and lattice points. II. Proc. Lond. Math. Soc. 1993, 66, 279–301. [Google Scholar] [CrossRef]
- Kolesnik, G. On the order of ζ( + it) and Δ(R). Pac. J. Math. 1982, 98, 107–122. [Google Scholar] [CrossRef]
- van der Corput, J.G. Zum Teilerproblem. Math. Ann. 1928, 98, 697–716. [Google Scholar] [CrossRef]
- Voronoï, G. Sur une fonction transcendante et ses applications à la sommation de quelques séries. Ann. Sci. École Norm. Sup. 1904, 21, 207–267. [Google Scholar] [CrossRef]
- Huxley, M.N. Exponential sums and lattice points. III. Proc. Lond. Math. Soc. 2003, 87, 591–609. [Google Scholar] [CrossRef]
- Lau, Y.-K.; Tsang, K.-M. On the mean square formula of the error term in the Dirichlet divisor problem. Math. Proc. Camb. Philos. Soc. 2009, 146, 277–287. [Google Scholar] [CrossRef]
- Ivić, A. The Riemann Zeta-Function; A Wiley-Interscience Publication; John Wiley & Sons, Inc.: New York, NY, USA, 1985. [Google Scholar]
- Ivić, A.; Sargos, P. On the higher moments of the error term in the divisor problem. Ill. J. Math. 2007, 51, 353–377. [Google Scholar] [CrossRef]
- Cao, X.; Tanigawa, Y.; Zhai, W. On hybrid moments of Δ2(x) and Δ3(x). Ramanujan J. 2022, 58, 597–631. [Google Scholar] [CrossRef]
- Li, J. On the seventh power moment of Δ(x). Int. J. Number Theory 2017, 13, 571–591. [Google Scholar] [CrossRef]
- Tsang, K.M. Higher-power moments of Δ(x), E(t) and P(x). Proc. Lond. Math. Soc. 1992, 65, 65–84. [Google Scholar] [CrossRef]
- Zhai, W. On higher-power moments of Δ(x). II. Acta Arith. 2004, 114, 35–54. [Google Scholar] [CrossRef]
- Zhai, W. On higher-power moments of Δ(x). III. Acta Arith. 2005, 118, 263–281. [Google Scholar] [CrossRef]
- Zhang, D.; Zhai, W. On the fifth-power moment of Δ(x). Int. J. Number Theory 2011, 7, 71–86. [Google Scholar] [CrossRef]
- Cao, X.; Furuya, J.; Tanigawa, Y.; Zhai, W. On the differences between two kinds of mean value formulas of number-theoretic error terms. Int. J. Number Theory 2014, 10, 1143–1170. [Google Scholar] [CrossRef]
- Furuya, J. On the average orders of the error term in the Dirichlet divisor problem. J. Number Theory 2005, 115, 1–26. [Google Scholar] [CrossRef][Green Version]
- Hardy, G.H. The Average Order of the Arithmetical Functions P(x) and Δ(x). Proc. Lond. Math. Soc. 1916, 15, 192–213. [Google Scholar] [CrossRef]
- Voronoi, G. Sur un problème du calcul des fonctions asymptotiques. J. Reine Angew. Math. 1903, 126, 241–282. [Google Scholar] [CrossRef]
- Guo, Z.; Li, X. On a sum of the error term of the dirichlet divisor function over primes. arXiv 2024, arXiv:2410.00329. [Google Scholar]
- Guo, Z.; Li, X. On high power moments of the error term of the dirichlet divisor function over primes. arXiv 2024, arXiv:2410.00936. [Google Scholar]
- Vinogradov, I.M. Representation of an odd number as the sum of three primes. Proc. Ussr Acad. Sci. 1937, 15, 129–132. [Google Scholar]
- Iwaniec, H.; Kowalski, E. Analytic Number Theory; Volume 53 of American Mathematical Society Colloquium Publications; American Mathematical Society: Providence, RI, USA, 2004. [Google Scholar]
- D. R. Heath-Brown. Prime numbers in short intervals and a generalized Vaughan identity. Can. J. Math. 1982, 34, 1365–1377. [Google Scholar] [CrossRef]
- Srinivasan, B.R. The lattice point problem of many-dimensional hyperboloids. II. Acta Arith. 1963, 8, 173–204. [Google Scholar] [CrossRef]
- Graham, S.W.; Kolesnik, G. Van der Corput’s Method of Exponential Sums; volume 126 of London Mathematical Society Lecture Note Series; Cambridge University Press: Cambridge, UK, 1991. [Google Scholar]
- Karatsuba, A.A. Basic Analytic Number Theory; Russian Edition; Springer: Berlin, Germany, 1993. [Google Scholar]
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content. |
© 2025 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/).