A note on Goldbach partitions of large even integers (Q2260612): Difference between revisions

Write \(Q_2(2k)\) for the number of ways \(2k\) can be represented as a sum of two primes. In the main theorem of the paper the author uses a classical Tauberian theorem due to Hardy, Littlewood and Karamata to show that \[ \sum_{k \leq n} Q_2(2k) = (1+o(1))\frac{2n^2}{\log^2 n}. \] The proof is not very long, but the reviewer would like to point out that such a result actually follows also in a more direct way from the prime number theorem by noting that the sum under consideration equals \[ \sum_{p_1 \leq 2n} \sum_{p_2 \leq 2n-p_1} 1, \] and here one can throw out very large \(p_1\), sum over \(p_2\) using prime number theorem, and then sum over \(p_1\) using prime number theorem and partial summation.