On sums of a prime and four prime squares in short intervals (Q5900500): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
links / mardi / name | links / mardi / name | ||
Revision as of 18:55, 30 January 2024
scientific article; zbMATH DE number 5378827
Language | Label | Description | Also known as |
---|---|---|---|
English | On sums of a prime and four prime squares in short intervals |
scientific article; zbMATH DE number 5378827 |
Statements
On sums of a prime and four prime squares in short intervals (English)
0 references
5 December 2008
0 references
In 1938 L. K. Hua proved that every (sufficiently large) integer \(N \not \equiv 1\pmod 3\) is a sum of a prime and four squares of primes. In 2004 \textit{X. Meng} [Acta Math. Hung. 105, No. 4, 261--283 (2004; Zbl 1102.11055)] gave the same result for, say, almost equal primes (now on letters \(p,p_j\) denote prime numbers), i.e.: \[ N=p+p_1^2+p_2^2+p_3^2+p_4^2,\;\text{with}\;\left| p-{N\over 5}\right|\leq \sqrt{{N\over 5}}U, \, \left| p_j-\sqrt{{N\over 5}}\right|\leq U \;\forall j\leq 4 \tag{1} \] where she was able to get \(U=N^{5/11+\varepsilon}\); however, her method gave no asymptotic formula for the representations of the number of solutions for \((1)\). The author, instead, both improves the range for \(U\), reaching \(U=N^{41/100+\varepsilon}\), and, also, gives an asymptotic formula for the (weighted) number of representations, say, \[ r(N):=\sum_{(1)}(\log p)(\log p_1)(\log p_2)(\log p_3)(\log p_4), \] \noindent with summation over \(p,p_j\), \(j\leq 4\), like previously given in \((1)\): \[ r(N)={1\over {16}}P_0\sigma(N)+{\mathcal O}(U^4L^{-A})\gg U^4, \] \noindent where \(A>0\) is arbitrary, and \(\sigma(N)\gg 1\), \(\forall N\not \equiv 1\pmod 3\), is the \textit{singular series} of the present problem (see the paper for details) and the following definition (see the paper) gives both \(P_0\ll U^4\) and \(P_0\gg U^4\) : \[ P_0:=\sum_{(2)}(m_1m_2m_3m_4)^{-1/2} \] (a kind of \textit{singular integral}) with \[ m+m_1+m_2+m_3+m_4=N, \text{with suitable restrictions on} \, m,m_j, \forall j\leq 4 \tag{2} \] The author applies, in the classical environment of the circle method, \textit{J. Liu}'s iterative method [see, Q. J. Math. 54, No. 4, 453--462 (2003; Zbl 1080.11071)], together with a new estimate for Dirichlet polynomials due to \textit{S. K.-K. Choi} and \textit{A. V. Kumchev} [Acta Arith. 123, No. 2, 125--142 (2006; Zbl 1182.11048)] and a new (2006) bound for exponential sums over primes, in short intervals, due to \textit{J. Liu, G. Lü} and \textit{T. Zhan} (there is a mistake in the references: the right reference should be [Sci. China, Ser. A 49, No. 5, 611--619 (2006; Zbl 1106.11033)]).
0 references
exponential sums over primes
0 references
circle method
0 references
Waring-Goldbach problems
0 references