Papers
Topics
Authors
Recent
Search
2000 character limit reached

A Diophantine inequality with four prime variables

Published 11 Nov 2018 in math.NT | (1811.10397v1)

Abstract: Let $N$ be a sufficiently large real number. In this paper, it is proved that, for $1<c<\frac{1193}{889}$, the following Diophantine inequality \begin{equation*} \big|p_1c+p_2c+p_3c+p_4c-N\big|<\log{-1}N \end{equation*} is solvable in prime variables $p_1,p_2,p_3,p_4$, which improves the result of Mu.

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.