On two Diophantine inequalities over primes (II)
Abstract
Let 1<c<2608803612301745,c=2 and N be a sufficiently large real number. In this paper, it is proved that, for almost all R∈ (N,2N], the Diophantine inequality equation* |p1c+p2c+p3c-R|<-1N equation* is solvable in primes p1,p2,p3. Moreover, we also prove that the following Diophantine inequality equation* |p1c+p2c+p3c+p4c+p5c+p6c-N|<-1N equation* is solvable in prime variables p1,p2,p3,p4,p5,p6, which improves the previous result 1<c<3718,c≠2.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.