Sums of nine almost equal prime cubes
Yanjun YAO
Sums of nine almost equal prime cubes
We prove that each sufficiently large odd integer N can be written as sum of the form with , where pj, j = 1, 2, … , 9, are primes and .
Waring-Goldbach problem / circle method / exponential sum over primes in short intervals
[1] |
Hua L K. Some results in the additive prime number theory. Q J Math, 1938, 9(1): 68-80
CrossRef
Google scholar
|
[2] |
Kumchev A V. On Weyl sums over primes in short intervals. In: “Arithmetic in Shangrila”—Proceedings of the 6th China-Japan Seminar on Number Theory. Series on Number Theory and Its Applications, 9. Singapore: World Scientific, 2012, 116-131
|
[3] |
Li T Y. Additive Problems with Prime Numbers. Ph D Thesis. Shandong University, 2012 (in Chinese)
|
[4] |
Liu J Y. An iterative method in the Waring-Goldbach problem. Chebyshevskii Sb, 2005, 5: 164-179
|
[5] |
Lü G S. Sums of nine almost equal prime cubes. Acta Math Sinica (Chin Ser), 2006, 49: 195-204 (in Chinese)
|
[6] |
Lü G S, Xu Y F. Hua’s theorem with nine almost equal prime variables. Acta Math Hungar, 2007, 116(4): 309-326
CrossRef
Google scholar
|
[7] |
Meng X M. The Waring-Goldbach problems in short intervals. J Shandong Univ Nat Sci, 1997, 3: 164-225
|
[8] |
Meng X M. On sums of nine almost equal prime cubes. J Shandong Univ Nat Sci, 2002, 37: 31-37
|
[9] |
Vaughan R C. The Hardy-Littlewood Method. 2nd ed. Cambridge: Cambridge University Press, 1997
CrossRef
Google scholar
|
[10] |
Zhao L L. On the Waring-Goldbach problem for fourth and sixth powers. Proc Lond Math Soc
CrossRef
Google scholar
|
/
〈 | 〉 |