On a theorem of Prachar involving prime powers (Q2898389)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On a theorem of Prachar involving prime powers |
scientific article; zbMATH DE number 6054411
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On a theorem of Prachar involving prime powers |
scientific article; zbMATH DE number 6054411 |
Statements
11 July 2012
0 references
Waring-Goldbach problem
0 references
Hardy-Littlewood method
0 references
unlike powers of primes
0 references
circle method
0 references
exponential sums
0 references
distribution of primes
0 references
0.9196662
0 references
0 references
0.9149784
0 references
0.9083066
0 references
0 references
0.90361035
0 references
On a theorem of Prachar involving prime powers (English)
0 references
The authors of this paper use the circle method to investigate the solubility of the Waring-Goldbach equation NEWLINE\[NEWLINEn = p_2^2 + p_3^3 + p_4^4 + p_5^5,NEWLINE\]NEWLINE where \(n\) is an even positive integer and the \(p_i\)'s are odd primes. Let \(N\) and \(U\) be large numbers and let \(E(N, U)\) denote the number of \(n\) in the interval \([N, N+U]\) such that the above equation has no solution satisfying \(|p_k^k -N/4| \leq U\) for \(k =2, 3, 4, 5\). Theorem 1 of the paper says that for \(U = N^{1 -\frac{1}{36} + \varepsilon}, \) it is true that \(E(N, U) \ll N^{1 -\varepsilon}\). In their notation, \(\varepsilon >0\) is arbitrary. NEWLINENEWLINETheorem 3 in the paper says that for any sufficiently large odd integer \(N\), the equation NEWLINE\[NEWLINEN = p_1 + p_2^2 + p_3^3 +p_4^4 +p_5^5NEWLINE\]NEWLINE has solutions with \(|p_k^k -\frac{N}{5}| \leq U, (k =1, 2, 3, 4, 5\)) for \(U = N^{1-\frac{1}{264} +\varepsilon}\).
0 references