On a Diophantine Inequality with Prime Numbers of a Special Type


Cite item

Full Text

Open Access Open Access
Restricted Access Access granted
Restricted Access Subscription Access

Abstract

We consider the Diophantine inequality |p1c + p2c + p3cN| < (logN)E, where 1 < c < 15/14, 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 p1, p2, p3 such that each of the numbers p1 + 2, p2 + 2 and p3 + 2 has at most [369/(180 − 168c)] prime factors, counted with multiplicity.

About the authors

D. I. Tolev

Faculty of Mathematics and Informatics

Author for correspondence.
Email: dtolev@fmi.uni-sofia.bg
Bulgaria, 5 J. Bourchier blvd., Sofia, 1164

Supplementary files

Supplementary Files
Action
1. JATS XML

Copyright (c) 2017 Pleiades Publishing, Ltd.