Some numerical implications of the Hardy and Littlewood analysis of the 3-primes problem (Q1124966)

Assuming a form of the Generalized Riemann Hypothesis (GRH), \textit{G. H. Hardy} and \textit{J. E. Littlewood} [Acta Math. 44, 1-70 (1922; JFM 48.0143.04)] proved that every large odd integer \(n\) (say \(n\geq N_0\)) is the sum of three primes. Under GRH it is now known that \(N_0=7\) [see \textit{J.-M. Deshouillers, G. Effinger, H. J. J. te Riele} and \textit{D. Zinoviev}, Electron. Res. Announc. Am. Math. Soc. 3, 99-104 (1997; Zbl 0892.11032)]. The aim of this paper is to give a completely explicit value for \(N_0\), using precisely the original argument of Hardy and Littlewood. A very careful analysis of each step in their proof is provided (with one exception: an estimate of Gronwall has to be replaced by a more delicate argument, in order to keep the resulting upper bound for \(N_0\) within reasonable size). The final result is that every odd \(n\geq 1.24\cdot 10^{50}\) is the sum of three primes. Some further estimates are also given, assuming only that the supremum \(\Theta\) of the real parts of all zeros of Dirichlet \(L\)-functions is \(<3/4\) (which was actually Hardy and Littlewood's original hypothesis).