Papers
Topics
Authors
Recent
Search
2000 character limit reached

On Two Diophantine Inequalities Over Primes

Published 29 Apr 2016 in math.NT | (1604.08717v2)

Abstract: Let $1<c<37/18,\,c\neq2$ and $N$ be a sufficiently large real number. In this paper, we prove that, for almost all $R\in(N,2N],$ the Diophantine inequality $|p_1c+p_2c+p_3c-R|<\log{-1}N$ is solvable in primes $p_1,\,p_2,\,p_3.$ Moreover, we also investigate the problem of six primes and prove that the Diophantine inequality $|p_1c+p_2c+p_3c+p_4c+p_5c+p_6c-N|<\log{-1}N$ is solvable in primes $p_1,\,p_2,\,p_3,\,p_4,\,p_5,\,p_6$ for sufficiently large real number $N$.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

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 (2)

Collections

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