2000 character limit reached
A ternary diophantine inequality by primes with one of the form $\mathbf{p=x^2+y^2+1}$ (2011.03967v4)
Published 8 Nov 2020 in math.NT
Abstract: In this paper we solve the ternary Piatetski-Shapiro inequality with prime numbers of a special form. More precisely we show that, for any fixed $1<c<\frac{427}{400}$, every sufficiently large positive number $N$ and a small constant $\varepsilon\>0$, the diophantine inequality \begin{equation*} |p_1c+p_2c+p_3c-N|<\varepsilon \end{equation*} has a solution in prime numbers $p_1,\,p_2,\,p_3$, such that $p_1=x2 + y2 +1$. For this purpose we establish a new Bombieri -- Vinogradov type result for exponential sums over primes.