On Two Diophantine Inequalities Over Primes
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$.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.