Advanced Search

For $\epsilon \>0$ and any sufficiently large odd $n$ we show that for almost all $k\le R:=n^{1/5-\epsilon }$ there exists a representation $n=p_1+p_2+p_3$ with primes $p_i\equiv b_i$ mod $k$ for almost all admissible triplets $b_1,b_2,b_3$ of reduced residues mod $k$.

Some mean value theorems in the style of Bombieri-Vinogradov’s theorem are discussed. They concern binary and ternary additive problems with primes in arithmetic progressions and short intervals. Nontrivial estimates for some of these mean values are given. As application inter alia, we show that for large odd $n\neg \equiv 1\left(6\right)$, Goldbach’s ternary problem $n=p_1+p_2+p_3$ is solvable with primes $p_1,p_2$ in short intervals $p_i\in [X_i,X_i+Y]$ with $X_i^{{\theta }_i}=Y$, $i=1,2$, and ${\theta }_1,{\theta }_2\ge 0.933$ such that $(p_1+2)(p_2+2)$ has at most $9$ prime factors.