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.
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.