2000 character limit reached
A quaternary diophantine inequality by prime numbers of a special type
Published 15 Feb 2017 in math.NT | (1702.04717v1)
Abstract: Let $1<c\<832/825$. For large real numbers $N\>0$ and a small constant $\vartheta>0$, the inequality \begin{equation*} |p_1c+p_2c+p_3c+p_4c-N|<\vartheta \end{equation*} has a solution in prime numbers $p_1,\,p_2,\,p_3,\,p_4$ such that, for each $i\in{1,2,3,4}$, $p_i+2$ has at most $32$ prime factors.
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.