Papers
Topics
Authors
Recent
Search
2000 character limit reached

On a diophantine inequality with prime numbers of a special type

Published 26 Jan 2017 in math.NT | (1701.07652v1)

Abstract: We consider the Diophantine inequality [ \left| p_1{c} + p_2{c} + p_3c- N \right| < (\log N){-E} , ] where $1 < c < \frac{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 $p_1$, $p_2$, $p_3$ such that each of the numbers $p_1 + 2, p_2 + 2, p_3 + 2$ has at most $\left[ \frac{369}{180 - 168 c} \right]$ prime factors, counted with the multiplicity.

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

Collections

Sign up for free to add this paper to one or more collections.