Some remarks on the binary Goldbach problem (Q689824): Difference between revisions

Two mean value results concerning the binary Goldbach problem are proved. (1) ``Almost all'' even numbers \(2k\) can be written as \(2k=p_ 1+p_ 2\) where \(p_ 1\leq k^{1/3+\varepsilon}\). This question was first studied by \textit{K. Prachar} [Monatsh. Math. 69, 62-68 (1965; Zbl 0152.033)]. (2) A Bombieri-Vinogradov type theorem for \(R(N)\), the number of binary Goldbach decompositions \[ \sum_{d\leq D} \max_{{c \atop {(2,d)| c}}} \sum_{{{N-H<2k\leq N} \atop {2k\equiv c(d)}}} | R(2k)-2k \sigma(2k)|^ 2 \ll_{\varepsilon,A} HN^ 2 L^{-A} \] (\(A>0\), \(0<\varepsilon<2/3\), \(N^{1/3+\varepsilon}\leq H\leq N\), \(D\leq HL^{- A-3}\), \(\sigma(2k)\) is the Hardy-Littlewood ``singular series''). The authors were informed that \textit{A. Perelli} independently obtained a similar result. The proofs follow the methods of \textit{H. Mikawa} [Tsukuba J. Math. 15, 19-29 (1991; Zbl 0735.11041)] and \textit{A. Perelli} and \textit{J. Pintz} [On the exceptional set of Goldbach's problem in short intervals, J. Lond. Math. Soc., II. Ser. 47, 41-49 (1993)].