sum of a prime and \(k\)-th power of a prime
On the exceptional set for the sum of a prime and the \(k\)-th power of a prime
The author proves that ``almost all'' integers which feasibly could be expressed as the sum of a prime and the \(k\)th power of a prime, actually can be so expressed. By ``almost all'' the author gives the surprisingly strong upper bound \(O_k(x^{1-\delta_k})\) for the number of exceptional \(n\) up to \(x\). The proof is modelled on \textit{H. L. Montgomery} and \textit{R. C. Vaughan}'s application of the circle method [Acta Arith. 27, 253-370 (1975; Zbl 0301.10043)] to the Goldbach problem (the case \(k=1\) here), though extensively modified, and also influenced by several papers that have appeared in the meantime.
scientific article; zbMATH DE number 1604252