Sums of almost equal squares of primes

From MaRDI portal



Abstract: We study the representations of large integers n as sums p12+...+ps2, where p1,...,ps are primes with |pi−(n/s)1/2|lenheta/2, for some fixed heta<1. When s=5 we use a sieve method to show that all sufficiently large integers nequiv5pmod24 can be represented in the above form for heta>8/9. This improves on earlier work by Liu, L"{u} and Zhan, who established a similar result for heta>9/10. We also obtain estimates for the number of integers n satisfying the necessary local conditions but lacking representations of the above form with s=3,4. When s=4 our estimates improve and generalize recent results by L"{u} and Zhai, and when s=3 they appear to be first of their kind.


The authors study the representation of large integers \(n\) as sums of almost equal squares of primes. In particular they show that all sufficiently large integers \(n\) satisfying a natural congruence condition, can be represented as a sum of five squares of primes \(p_j\) such that \(|p_j - (n/5)^{1/2}| \leq n^{4/9+\varepsilon}\). This improves on a result of \textit{J. Liu, G. Lü} and \textit{T. Zhan} [Sci. China, Ser. A 49, No. 5, 611--619 (2006; Zbl 1106.11033)], who had \(9/20\) in place of \(4/9\). The proof uses the circle method, and the improvement is based on bringing in Harman's sieve method (see [\textit{G. Harman}, Prime-detecting sieves. Princeton, NJ: Princeton University Press (2007; Zbl 1220.11118)]) The paper contains also results which concern exceptional sets for representations with less than five almost equal squares, as well as a result on how ``almost equal the squares can be made. In that case there are \(s > 5\) of them.











This page was built for publication: Sums of almost equal squares of primes

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