On two Diophantine inequalities over primes (II)

preprint2020arXivOpen access

Abstract

Let 1<c<2608803612301745,c≠21<c<\frac{26088036}{12301745},c\not=2 and NN be a sufficiently large real number. In this paper, it is proved that, for almost all R∈(N,2N]R\in (N,2N], the Diophantine inequality \begin{equation*} \big|p_1^c+p_2^c+p_3^c-R\big|<\log^{-1}N \end{equation*} is solvable in primes p1,p2,p3p_1,p_2,p_3. Moreover, we also prove that the following Diophantine inequality \begin{equation*} \big|p_1^c+p_2^c+p_3^c+p_4^c+p_5^c+p_6^c-N\big|<\log^{-1}N \end{equation*} is solvable in prime variables p1,p2,p3,p4,p5,p6p_1,p_2,p_3,p_4,p_5,p_6, which improves the previous result 1<c<3718,c≠21<c<\frac{37}{18},c\neq2.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.