We show that for almost all $n\in \mathbf{N}$, the inequality$$|p_1+p_2-\exp \left(\right(\log n{)}^{\gamma }\left)\right|\<1$$has solutions with odd prime numbers $p_1$ and $p_2$, provided $1\<\gamma \<\frac{3}{2}$. Moreover, we give a rather sharp bound for the exceptional set.This result provides almost-all results for Goldbach numbers in sequences rather thinner than the values taken by any polynomial.

Let N be a large positive real number. It is well known that almost all even integers in the interval [N, 2N] are Goldbach numbers, i.e. a sum of two primes. The same result also holds for short intervals of the form [N, N+H], see Mikawa [4], Perelli-Pintz [7] and Kaczorowski-Perelli-Pintz [3] for the choice of admissible values of H and the size of the exceptional set in several problems in this direction.One may ask if similar results hold for thinner sequences of integers in [N, 2N], of cardinality...

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.