English

On a diophantine inequality with prime numbers of a special type

Number Theory 2017-01-27 v1

Abstract

We consider the Diophantine inequality p1c+p2c+p3cN<(logN)E, \left| p_1^{c} + p_2^{c} + p_3^c- N \right| < (\log N)^{-E} , where 1<c<15141 < c < \frac{15}{14}, NN is a sufficiently large real number and E>0E>0 is an arbitrarily large constant. We prove that the above inequality has a solution in primes p1p_1, p2p_2, p3p_3 such that each of the numbers p1+2,p2+2,p3+2p_1 + 2, p_2 + 2, p_3 + 2 has at most [369180168c]\left[ \frac{369}{180 - 168 c} \right] prime factors, counted with the multiplicity.

Keywords

Cite

@article{arxiv.1701.07652,
  title  = {On a diophantine inequality with prime numbers of a special type},
  author = {D. I. Tolev},
  journal= {arXiv preprint arXiv:1701.07652},
  year   = {2017}
}