On a binary diophantine inequality involving prime numbers (Q1125603)

Suppose that \(1<c<\frac{15}{14}\) and \(N\) is a sufficiently large real number. In this paper the author proves the following theorem: For all \(\eta\in(N,2N]\setminus A\) with \(| A| =O( N\exp(-\frac 13 (\log N)^{\frac 15}))\) the inequality \[ | p^c_1+p^c_2-\eta| <\eta^{1-\frac {15}{14c}}(\log N)^8 \] has solutions in primes \(p_1,p_2\leq N^{\frac 1c}\). This theorem is related to the results of \textit{D. I. Tolev} [Acta Arith. 61, 289-306 (1992; Zbl 0762.11033)].