The ternary Goldbach problem with a prime and two isolated primes (Q2362404): Difference between revisions

We say that a prime \(p\) is isolated if \(\log_4 p \geq 1\) and \(m\) is composite for all positive integers \(m\) with \[ 0< |p-m| \leq \delta \log p \frac{\log_2 p \log_4 p}{\log_3 p}, \] where \(\log_j\) is the \(j\)th iterate of logarithm and \(\delta\) is a small enough constant. The authors show a variant of the ternary Goldbach problem for isolated primes. More precisely, they show that, assuming the Riemann hypothesis, each large enough odd integer is the sum of a prime and two isolated primes. To show this, the authors first use techniques of \textit{K. Ford} et al. [J. Am. Math. Soc. 31, No. 1, 65--105 (2018; Zbl 1392.11071)] on large gaps between primes to show that there exists \(\varepsilon >0\) such that, for every sufficiently large odd integer \(N\), there exists an integer \(P^\ast \in [N^{\varepsilon}, N^{1/100}]\) and an integer \(u_0 \in [(P^\ast)^\varepsilon, P^\ast]\) such that \[ (u_0, P^\ast) = (N-2u_0, P^\ast) = 1 \] and \((m, P^\ast) > 1\) whenever \[ 0 <|u_0 - m | \leq \varepsilon \log N \frac{\log_2 N \log_4 N}{\log_3 N}. \] Then, the authors use standard circle method techniques to show that, assuming the Riemann hypothesis, one can write \(N = p_1 + p_2 + p_3\), where \(p_1, p_2, p_3\) are primes and \(p_1, p_2 \equiv u_0 \pmod{P^\ast}\) and \(p_3 \equiv N-2u_0 \pmod{P^\ast}.\) These two ingredients clearly imply the claim.