• A ternary diophantine inequality with prime numbers of a special type

    • Fulltext


        Click here to view fulltext PDF

      Permanent link:

    • Keywords


      Diophantine inequality; exponential sum; prime

    • Abstract


      We consider the inequality $$|p^{c}_{1}+ p^{c}_{2}+ p^{c}_{3}− N| < (log N)^{−E},$$ where $1$ < $c$ < $\frac{281}{250}$ , $N$ is a sufficiently large real number and $E$ > $0$ is an arbitrarily large constant. We prove that the above inequality has a solution in primes $p_{1}, p_{2}, p_{3}$ such that each of the numbers $p_{1} + 2, p_{2} + 2, p_{3} + 2$ has at most [$\frac{1475}{562−500c}$] prime factors, counted with the multiplicity. This result constitutes an improvement upon that of Tolev.

    • Author Affiliations


      LI ZHU1

      1. School of Statistics and Mathematics, Shanghai Lixin University of Accounting and Finance, Shanghai 201209, People’s Republic of China
    • Dates

  • Proceedings – Mathematical Sciences | News

    • Editorial Note on Continuous Article Publication

      Posted on July 25, 2019

      Click here for Editorial Note on CAP Mode

© 2021-2022 Indian Academy of Sciences, Bengaluru.