Representation of an integer as the sum of a prime in arithmetic progression and a square-free integer
Kam Hung Yau

TL;DR
This paper develops an abstract circle method to estimate the number of representations of large integers as the sum of a prime in an arithmetic progression and a square-free integer, uniformly for small moduli.
Contribution
It introduces a novel application of the local model approach to the circle method for problems involving primes and square-free integers.
Findings
Provides an estimate for the weighted count of such representations
Achieves uniformity for small moduli q
Extends circle method techniques to new additive problems
Abstract
Uniformly for small and , we obtain an estimate for the weighted number of ways a sufficiently large integer can be represented as the sum of a prime congruent to modulo and a square-free integer. Our method is based on the notion of local model developed by Ramar\'e and may be viewed as an abstract circle method.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAnalytic Number Theory Research · Limits and Structures in Graph Theory · Advanced Mathematical Identities
Representation of an integer as the sum of a prime in arithmetic progression and a square-free integer
Kam Hung Yau
Department of Pure Mathematics, University of New South Wales, Sydney, NSW 2052, Australia
Abstract.
Uniformly for small and , we obtain an estimate for the weighted number of ways a sufficiently large integer can be represented as the sum of a prime congruent to modulo and a square-free integer. Our method is based on the notion of local model developed by Ramaré and may be viewed as an abstract circle method.
Key words and phrases:
binary additive problem, Circle method, local model, Ramanujan sum
2010 Mathematics Subject Classification:
11P32, 11P55, 11T23
1. Introduction
The Goldbach conjecture states that every even integer greater than two can be expressed as the sum of two primes. Although this remains an open problem due to the parity phenomenon, there are various progress and relaxations which contributes toward this direction.
Mordern sieve method can be traced back to the earlier works of Brun. In 1920, Brun [1] showed that every sufficiently large even integer can be written as the sum of two numbers which have together at most nine prime divisors. Later, the celebrated result of Chen [3] established that every sufficiently large even integer can be written as the sum of a prime and a number with at most two prime factors.
Initiated by Linnik [15] in 1953, he showed that every sufficiently large even integer can be written as a sum of two primes and at most powers of two, where is an absolute constant although non-explicit. Many authors had made explicit where the best result is due to Liu & Lü [17], improving the remarkable result by Heath-Brown & Puchta [11].
Another relaxation is the ternary Goldbach conjecture which states that all odd integer greater than five is the sum of three primes. Vinogradov [23] developed a way to estimate sums over primes which combined with the circle method showed the ternary Goldbach conjecture is true for all large odd integer greater than . Recently, Helfgott [12] completed the proof of ternary Goldbach conjecture by sufficiently reducing the size and verified that no counterexample exists below .
We also have results when we replace one of the primes in the Goldbach conjecture by a square-free integer. Estermann [6] obtained an asymptotic formula for the number of representation of a sufficently large integer as the sum of a prime and a square-free number. Later, Page [20] improved on the error term of Estermann [6] and Mirsky [18] improved and extended these results to count the number of representions of an integer as the sum of a prime and a -free number. Recently, Dudek [5] by tools of explicit number theory demonstrated that every integer greater than two can be a sum of a prime and a square-free integer.
In this paper we are motivated by a question posed in the PhD thesis of Dudek [4, Chapter 6, Problem 8]. Specifically Dudek asked for , can all sufficiently large integer without local obstruction be a sum of a prime such that and a square-free integer. A similar problem on the number of representations of a sufficiently large integer to be the sum of two square-free integer has been studied by Evelyn & Linfoot [8] and later simplified by Estermann [7]. The best result is achieved by Brüdern & Perelli [2].
There are mainly two advanced techniques for attacking certain binary additive problems: sieve method [9] and the dispersion method of Linnik [16]. We note that the circle method [22] has certain difficulity in dealing with binary additive problems. Our method applied here is due to Ramaré [21] on his notion of local model, and can be viewed as an abstract circle method. We remark that Heath-Brown [10] had already notice this connection for his alternate prove of Vinogradov’s three prime theorem [23].
Lastly the techniques used here may be adapted for various other binary additive problems. In particular, the author expects that it should be possible to prove an asymptotic bound for the number of representation of an integer as the sum of a square-free integer and a prime such that is square-free.
2. Notation
The statements and are both equivalent to for some fixed positive constant . If depends on a parameter, say , then we may write or .
For completeness, we recall the following standard notation in analytic number theory.
[TABLE]
3. Main result
We denote
[TABLE]
to be the weighted number of representations for as the sum of a prime congruent to modulo and a square-free integer.
We now state a bound for which is uniform for small .
Theorem 3.1**.**
Let then we have
[TABLE]
uniformly for and . The singular series is given by
[TABLE]
The implied constant in the reminder term is ineffective as the Siegel-Walfisz Theorem is ineffective. In view of Lemma 5.3, we can rewrite the singular series in a more rudimentary form
[TABLE]
If and then it follows for all primes that is never square-free and hence . This coincide exactly to the case when vanishes.
Using the well-known convolution identity and assuming the GRH (Generalised Riemann Hypothesis), the error term in (3.1) can be replaced by . Indeed on the GRH, we obtain
[TABLE]
Taking gives the result. It seems the error term cannot be further improved (assuming the GRH) using the local model method.
Observe that when we take in Theorem 3.1, we obtain a special case of Mirsky [18] (after weighing but with a weaker error term). Indeed our singular series simplifies to
[TABLE]
4. Outline of Method
For a more thorough exposition, see [21, Chapter 1,4 &17]. Our method will model that of [21, Chapter 19] where therein Ramaré proved an asymptotic bound for the number of representations of a sufficiently large integer as a sum of two square-free integer.
We press forward and recall the definition of local and global product, see (5.5) and (4.1) respectively.
Set as an almost orthogonal system by the following collection of information:
- (i)
a finite family of elements of , 2. (ii)
a finite family of positive real numbers,
and
[TABLE]
for all .
The special case of choosing an orthogonal basis is enlightening. If were orthogonal then we may take .
Let be the vector space of all complex valued functions on the positive integers and
[TABLE]
be the usual scalar product (global Hermitian product) for all .
Let , and . Observe that
[TABLE]
is the weighted number of representations for to be a sum of a prime congruent to modulo and a square-free integer. Our ultimate goal is to compute and we shall use the notion of local model to this end.
Indeed let be a carefully chosen set of moduli, we construct two local models and to approximate and respectively, and in some sense they are made to copy the distribution of and in arithmetic progression respectively.
Next we take to be essentially the union of some linear combination of and , this will be the local model accountable for both and . Furthermore for all , we set , see [21, Lemma 1.1]. This gives rise to an almost orthogonal system and in particular will imply the scalar product
[TABLE]
is small in a suitable sense. The construction will also secure to be small when . Expanding the inner product, we have
[TABLE]
Here we take and as motivated by the orthogonal case. Simplifying gives
[TABLE]
The error term can be shown to be sufficiently small by appealing to the local model. The summand in the sum above can then be replaced by a tractable expression for which we can compute explicitly and the result soon follows.
5. Preparations
5.1. Number theoretical considerations
We record here various number theoretical lemmas needed in subsequent sections. For completeness we will also include several straightforward lemmas that may be applied freely without reference.
First we recall the well-known orthogonality of exponential sums [19, Equation 4.1].
Lemma 5.1**.**
For any positive integer , we have
[TABLE]
Next we recall the Chinese remainder theorem for arbitrary modulus [14, Theorem 3.12].
Lemma 5.2** (Chinese remainder theorem).**
Let for and . The following system of congruences for is solvable if and only if for any . If the system is solvable then for some and any two such are congruent modulo . Moreover, for if and only if .
We recall from [19, Theorem 4.1] some fundamental properties of Ramanujan sums.
Lemma 5.3**.**
For any positive integers and , the Ramanujan sum is a multiplicative function of . Moreover we have
[TABLE]
and hence . In particular
[TABLE]
The next result provides an explicit expression for detecting equality for divisors [21, Corollary 3.1].
Lemma 5.4**.**
For integer and any divisor of , we have
[TABLE]
We record below a sensational result which gives an estimate for the number of primes in an arithmetic progression for small moduli [13, Corollary 5.29].
Lemma 5.5** (Siegel-Walfisz).**
For any , we have
[TABLE]
uniformly for and .
Finally we state an auxiliary lemma that we will need later.
Lemma 5.6**.**
For all cubefree positive integers and , we have
[TABLE]
Proof.
Write and where . We factor our sum
[TABLE]
If there exist a prime factor that divides but not then the sum vanishes. By symmetry, we are left to consider the case and in turn the sum simplifies to
[TABLE]
\sqcap$$\sqcup
5.2. Arithmetic functions in arithmetic progression
The following result provides an asymptotic for the number of square-free integers in an arithmetic progression.
Note that we canonically extend the characteristics function of the square-free integers to negative integers by . We recall a result from [21, Lemma 19.1].
Lemma 5.7**.**
For any , we have
[TABLE]
Here
[TABLE]
As in the notation of [21, Chapter 19], for cubefree we define
[TABLE]
with and
[TABLE]
Note that in some sense is defined to imitate in arithmetic progression.
We recall the following result from [21, Lemma 19.2] which provides an explicit expression for .
Lemma 5.8**.**
We have if is a positive cubefree integer, while if has a cubic factor greater than then .
Let and be a positive cubefree integer, denote
[TABLE]
To motivate the definition of , consider the sum
[TABLE]
By the Chinese remainder theorem, the simultaneous congruence equations is solvable if and only if and . If this is the case then for some we should expect
[TABLE]
We remark that if then .
Lemma 5.9**.**
For positive cubefree integers with , we have
[TABLE]
In particular for any positive integer , is a multiplicative function of .
Proof.
If then either or . If then we have or . Consequently for both cases we obtain
[TABLE]
Clearly and if and only if we satisfy both the conditions
[TABLE]
Hence it is enough to show
[TABLE]
Let us recall the identity for all positive integers . Consequently
[TABLE]
since
[TABLE]
The result follows immediately. \sqcap$$\sqcup
We are now ready to define our local approximation for . Set
[TABLE]
for any positive cubefree integer .
The next result provides an explicit expression for .
Lemma 5.10**.**
Let with . If then . For any positive integer , is a multiplicative function of . Furthermore
[TABLE]
Proof.
We note that if then for all divisors of . Hence
[TABLE]
Appealing to Lemma 5.9, is a Dirichlet convolution of two multiplicative functions, hence is multiplicative in . Therefore we factor
[TABLE]
We first consider . Recall that and so
[TABLE]
From (5.2), we check
[TABLE]
In the last line, we note that the condition implies that since . Therefore
[TABLE]
Lastly, we turn to and we see for any that
[TABLE]
We readily check that is
[TABLE]
We condense the expression to the simpler
[TABLE]
since . Hence we obtain
[TABLE]
The result follows immediately. \sqcap$$\sqcup
5.3. Local Hermitian product
In this section we compute various local Hermitian products explicitly.
We denote
[TABLE]
for all positive cubefree integer .
For fixed , we denote to be the vector space of complex valued functions over . We endow this vector space with the local Hermitian product by setting
[TABLE]
for all .
We now state an explicit expression for the norms of and .
Lemma 5.11**.**
For all with , we have
[TABLE]
and
[TABLE]
Proof.
The expression for can be derived as in [21, Equation (19.10)].
Write
[TABLE]
If then we are done since by Lemma 5.10. Otherwise, by the Chinese remainder theorem we factor
[TABLE]
Appealing to (5.3), we readily check
[TABLE]
By Lemma 5.10, expanding the Ramanujan sum and interchanging the summation, we obtain
[TABLE]
By orthogonality, we get
[TABLE]
It follows
[TABLE]
since
[TABLE]
\sqcap$$\sqcup
For all positive cubefree integer , we denote
[TABLE]
where
[TABLE]
We now state a result which provides an explicit expression for and .
Lemma 5.12**.**
The function is a multiplicative function of . Moreover we have
[TABLE]
and
[TABLE]
Proof.
For positive cubefree integers with , we have by the Chinese remainder theorem
[TABLE]
where in the second line we used Lemma 5.10. Similarly, we show that is a multiplicative function in .
First we assume that , appealing to (5.3) we get
[TABLE]
Since and hence by orthogonality we have
[TABLE]
Now assume and appealing to (5.3) we obtain
[TABLE]
Since , orthogonality gives
[TABLE]
Next we consider . If then we are done, otherwise expanding the Ramanujan sum and interchanging summation, we obtain
[TABLE]
Appealing to orthogonality then gives
[TABLE]
\sqcap$$\sqcup
Next, we derive an explicit expression for the cross product .
Lemma 5.13**.**
For all with , we have
[TABLE]
Proof.
If then we are done, otherwise
[TABLE]
Therefore by the previous lemma, we arrive at
[TABLE]
and the result follows. \sqcap$$\sqcup
5.4. Local models and their products
Let with , we denote
[TABLE]
[TABLE]
where
[TABLE]
is just but without the divisibility condition on , see Lemma 5.10. In particular, we can write
[TABLE]
Below, we compute the norms of and .
Lemma 5.14**.**
We have
[TABLE]
[TABLE]
and
[TABLE]
Proof.
The norms for and follows immediately from Lemma 5.11, 5.13 and that both and are real valued.
Showing
[TABLE]
also follows from Lemma 5.11, 5.13. \sqcap$$\sqcup
Note that and when
[TABLE]
Next, we will show there is a Hermitian relationship between the global (4.1) and local (5.5) products.
Given a function , we denote to be a function on defined by
[TABLE]
For a function , we denote to be a function on the positive integers such that
[TABLE]
Note that is not the identity. For and , we readily check that
[TABLE]
Indeed
[TABLE]
Let us set and . Now we compute the cross products of and .
Lemma 5.15**.**
For all positive cubefree integers and , we have
[TABLE]
Proof.
Write and with . By appealing to (5.4), (5.6), Lemma 5.8 and 5.10, we expand
[TABLE]
where
[TABLE]
Using the explicit form of and applying Lemma 5.3, we have
[TABLE]
since . By Lemma 5.6, we get
[TABLE]
Next we deal with . Expanding each for the four Ramanujan sum and taking the summation over inside, we obtain
[TABLE]
Observe that since and . By the Chinese reminder theorem, the system of congruences in the summation over can be reduced to one congruence for some . Since , we verify that
[TABLE]
Next, we glue the variables and together and get
[TABLE]
By Lemma 5.6, we obtain
[TABLE]
Now we consider . Again, expanding the Ramanujan sums and interchanging summations, we get
[TABLE]
Since , the system of congruence in the inner sum is solvable if and only if and . It follows by the Chinese remainder theorem that
[TABLE]
where
[TABLE]
The dependency on the divisibility condition over the summation of and is troublesome. We deal with this by Lemma 5.4 and observe that
[TABLE]
and
[TABLE]
Substituting this into and gluing the variables and and noticing that since , and , we assert
[TABLE]
If then by Lemma 5.6. If then again by Lemma 5.6, we get
[TABLE]
Notice that for and , we rewrite the Euler totient function as a Dirichlet convolution
[TABLE]
Substituting this into the above and interchanging summation, we obtain
[TABLE]
From Lemma 5.3 we notice
[TABLE]
and
[TABLE]
Therefore the sum in question collapses into
[TABLE]
Hence we have
[TABLE]
Similarly we also have
[TABLE]
Gathering all the estimates above, we finally get
[TABLE]
and the result follows from Lemma 5.14.
The remaining bounds for and follows immediately from our computation of . \sqcap$$\sqcup
5.5. Approximating and
In this section we impose implicitly the condition
[TABLE]
Take our set of moduli to be
[TABLE]
Here
[TABLE]
where will be chosen later. We also set
[TABLE]
and in particular this implies . The set will be referenced in the preceding lemmas.
Finally, we recall and let
[TABLE]
and
[TABLE]
for all .
Lemma 5.16**.**
For any and , we have
[TABLE]
and
[TABLE]
In particular, we have
[TABLE]
and
[TABLE]
All implied constant above may depend on .
Proof.
By (5.8), we get
[TABLE]
Note that by (5.6) and (5.7), we have
[TABLE]
By the Möbius inversion formula that
[TABLE]
and it follows
[TABLE]
Following the proof of Lemma 5.15 the summand is zero unless , and hence . It follows
[TABLE]
Write
[TABLE]
where
[TABLE]
We crudely bound using the Siegel-Walfisz Theorem (Lemma 5.5) to get
[TABLE]
Next we turn to . Similarly we get
[TABLE]
Note that by (5.6) and (5.7), we have
[TABLE]
By the Möbius inversion formula, we have
[TABLE]
and it follows
[TABLE]
Again following the proof of Lemma 5.15, the summand vanishes unless , and hence . Therefore
[TABLE]
We can deal with just like above but we apply Lemma 5.7 instead of Lemma 5.5 to get
[TABLE]
The bounds for and follows similarly. \sqcap$$\sqcup
Denote
[TABLE]
and note that if and only if . The set will be referenced in the preceding lemmas.
Now we give upper and lower bounds for these norms.
Lemma 5.17**.**
For all , we have
[TABLE]
The same holds when we replace with .
Proof.
From Lemma 5.14, we get
[TABLE]
Clearly
[TABLE]
and the upper bound follows.
For the lower bound, note that
[TABLE]
strictly divides , hence
[TABLE]
The bound for is similar. \sqcap$$\sqcup
Next we need to estimate the sums
[TABLE]
for all and
[TABLE]
for all . But first, we need an a priori bound.
Lemma 5.18**.**
We have
[TABLE]
Proof.
The sum is majorized by
[TABLE]
\sqcap$$\sqcup
We only show for (5.14) as (5.15) is similar. By Lemma 5.15 and 5.18, we get that (5.14) is
[TABLE]
This motivates the following definition. Let and be large enough so that it dominates both (5.14) and (5.15). Next we set
[TABLE]
for all and
[TABLE]
for all .
The following result shows that we can replace and by and respectively in the summand up to an error term.
Lemma 5.19**.**
If
[TABLE]
for all or if
[TABLE]
for all then
[TABLE]
The same holds if we replace by .
Proof.
Taking the difference and by Lemma 5.17, it is enough to bound
[TABLE]
First we suppose (5.16) and recalling (5.1), we majorize the sum above by
[TABLE]
Therefore (5.18) holds. The same argument holds if we replace by .
Next we assume (5.17). Using (5.19) and Lemma 5.17, we are lead to bound
[TABLE]
Recalling (5.1), the sum above is majorized by
[TABLE]
The same holds when we replace by . \sqcap$$\sqcup
Lemma 5.20**.**
For all , we have
[TABLE]
is
[TABLE]
Proof.
Write
[TABLE]
where . By Lemma 5.16, we replace by up to an error term. Indeed
[TABLE]
after recalling (5.1) and using the bound
[TABLE]
collected from Lemma 5.16 and 5.17. Reiterating again we have
[TABLE]
We repeat this for the other sum and in total we get
[TABLE]
By Lemma 5.19, we replace by up to an error term and get
[TABLE]
We recall from (5.13)
[TABLE]
it follows
[TABLE]
by (5.12), (5.13) and Lemma 5.11, 5.14.
Next, we reiterate the process and replace by up to an error term. In total we get
[TABLE]
By Lemma 5.11 we have
[TABLE]
and thus completing the series we obtain
[TABLE]
Observe that by Lemma 5.7
[TABLE]
and the result follows. \sqcap$$\sqcup
Lemma 5.21**.**
The sum
[TABLE]
Proof.
By Lemma 1.1 and 1.2 of [21] we see that
[TABLE]
Therefore it is enough to bound and indeed we have
[TABLE]
\sqcap$$\sqcup
Lemma 5.22**.**
For all , we have
[TABLE]
is
[TABLE]
where is the singular series defined in Theorem 3.1.
Proof.
For simplicity all implied constant in the term may depend on .
Set . By Lemma 5.16, we obtain
[TABLE]
by using the bound
[TABLE]
provided by Lemma 5.16 and 5.17.
Now set . Then again by Lemma 5.16, we have
[TABLE]
By Lemma 5.16 and 5.17, we assert
[TABLE]
and recalling (5.1) we get that the error term is .
We do the same for the other sum and we ultimately get
[TABLE]
Next by applying Lemma 5.19 we replace with up to an error term and obtain
[TABLE]
We recall from (5.13) and (5.12) that
[TABLE]
and
[TABLE]
It follows
[TABLE]
by (5.12), (5.13) and Lemma 5.13, 5.14.
We reiterate the same procedure and replace with up to an error term. In total we have
[TABLE]
Next we compute the sum
[TABLE]
We complete the series and so the right hand side becomes
[TABLE]
up to an error term of
[TABLE]
since the number of divisors of is at most and by recalling (5.1). The singular series can be represented as an infinite product
[TABLE]
If then the term in the product simplifies to
[TABLE]
If then the term in the product simplifies to
[TABLE]
If then the term in the product simplifies to
[TABLE]
The result follows. \sqcap$$\sqcup
6. Proof of Theorem 3.1
For any , let us denote
[TABLE]
We recall from (5.10), (5.11) respectively and consequently the scalar product
[TABLE]
By Cauchy’s inequality, we assert
[TABLE]
By Lemma 5.20 and 5.21, the right hand side is majorised by
[TABLE]
Hence we can approximate by and by Lemma 5.22 we obtain
[TABLE]
Recall from (5.9) that , and . Taking
[TABLE]
simplifies the error term to
[TABLE]
Notice that
[TABLE]
The double sum can be estimated crudely by
[TABLE]
and consequently
[TABLE]
If then there exists such that by our remark after Theorem 3.1. Hence and the result follows immediately. Otherwise if then we bound from below
[TABLE]
Applying a Taylor series expansion for the logarithm
[TABLE]
valid for , we obtain
[TABLE]
Therefore
[TABLE]
and so
[TABLE]
Acknowledgement
The author thanks I. E. Shparlinski and L. Zhao for many helpful comments and discussions, and O. Ramaré for helpful discussions. The author also thanks the referee for many helpful comments and suggestions. This work is supported by an Australian Government Research Training Program (RTP) Scholarship, UNSW Science PhD Writing Scholarship, and the Lift-off Fellowship of the Australian Mathematical Society.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] V. Brun, Le crible d’Eratosthene et le théorème de Goldbach. Skr. Norske Vid.-Akad. Kristiana (1920), no. 3, 36.
- 2[2] J. Brüdern, A. Perelli, Exponential sums of additive problems involving square-free numbers. Ann. Scuola Norm. Sup. Pisa Cl. Sci. (4) 28 (4) (1999), 591-613.
- 3[3] J.-R. Chen, On the representation of a larger even integer as the sum of a prime and the product of at most two primes. Sci. Sinica 16 (1973), 157–176.
- 4[4] A. W. Dudek, Explicit estimates in the theory of prime numbers. Ph.D. thesis, The Australian National University, 2016.
- 5[5] A. W. Dudek, On the sum of a prime and a square-free number. Ramanujan J. 42 (1) (2017), 233–240.
- 6[6] T. Estermann, On the representations of a number as the sum of a prime and a quadratfrei number. J. Lond. Math. Soc. 6 (3) (1931), 219–221.
- 7[7] T. Estermann, On the representations of a number as the sum of two numbers not divisible by k 𝑘 k -th powers. J. Lond. Math. Soc. 6 (1) (1931), 37–40.
- 8[8] C. J. A. Evelyn, E. H. Linfoot, On a problem in the additive theory of numbers. Math. Z. 34 (1) (1932), 637–644.
