2000 character limit reached
The ternary Goldbach problem with prime numbers of a mixed type (1711.02472v2)
Published 7 Nov 2017 in math.NT
Abstract: In the present paper we prove that every sufficiently large odd integer $N$ can be represented in the form \begin{equation*} N=p_1+p_2+p_3\,, \end{equation*} where $p_1,p_2,p_3$ are primes, such that $p_1=x2 + y2 +1$, $p_2=[nc]$.