On some additive problems of Goldbach's type

In this paper, we find an asymptotic formula with power-saving remainder term for the number of solutions of one non-linear ternary problem with primes. The proof is based on the "precise formula" for Chebyshev's function involving the zeros of Riemann zeta function. In fact, a ternary problem "at each zero" is solved. I. M. Vinogradov's solution of the ternary Goldbach problem (1937, see [1], [2]) opened the way of solving a wide class of problems of the above type. In 1938, he found a power-saving estimate (with respect to the length of the summation interval) for the mean value of the modulus of the exponential sum with primes (see [2], theorem 3, p.82; theorems 6 and 7, p.86). Starting at 1996, G.I.Arkhipov, K.Buriev and the author have obtained several results concerning the exceptional sets in some binary problems of Goldbach's type. These results used both the tools of the theory of Diophantine approximations and the "precise formulas" from Riemann's zeta function theory. At the same time, the method of estimating of linear sums with primes based on the measure theory was derived in the papers of G. L. Watson, D. Bruedern, R. D. Cook and A. Perelli.