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

From MaRDI portal
Publication:2238282



Abstract: Uniformly for small q and (a,q)=1, 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 a modulo q 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.


It is proved the following result for a weighted number of representations for a sufficiently large integer \(N\) as the sum of a prime number \(p\) congruent to \(a\) modulo \(q\) and a square-free integer \(n\): given positive real numbers \(C_1,C_2\), the asymptotic formula \[ \sum_{\substack{N=p+n\\ p\equiv a\,\mathrm{mod}\, q}}\mu(n)^2\log p=\mathfrak{S}_{a,q}(N)N\Big(1+O_{C_1,C_2}(\log^{-C_2} N)\Big) \] holds uniformly for relatively prime \(a,q\), with \(q\le \log^{C_1}N\), where \(\mu\) is the Möbius function and \(\mathfrak{S}_{a,q}(N)\) is the singular series associated to the problem. The method of the proof is mainly based on the local model developed by Ramaré in his book [\textit{O. Ramaré}, Arithmetical aspects of the large sieve inequality, Harish-Chandra Research Institute Lecture Notes 1, Hindustan Book Agency (2009; Zbl 1177.11081)].











This page was built for publication: Representation of an integer as the sum of a prime in arithmetic progression and a square-free integer

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2238282)