The Waring-Goldbach problem

From MaRDI portal


Lua error in Module:PublicationMSCList at line 28: attempt to call field 'getDbData' (a nil value).


Lua error in Module:PublicationShowAbstract at line 21: attempt to call field 'getDbData' (a nil value).


Let \(n\) be a positive integer. The main contribution of the paper under review is the following theorem. There exist constants \(V=V(n)\) and \(c=c(n)\) (depending on \(n\) only) such that every positive integer \(N\geq c\) can be written as a sum \(N=p_1^n+\ldots+p_r^n\) where \(p_1\), \dots, \(p_r\) are primes, and \(r\leq V\). The proof uses some ideas of the proof given by Vinogradov in the 1930s for the estimates of the Waring problem.











This page was built for publication: The Waring-Goldbach problem

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