加载中…
Let be a sufficiently large real number. In this paper, it is proved that, for and for any arbitrary large number , the Diophantine inequality \begin{equation*} \big|p_1^c+p_2^c+p_3^c+p_4^c-N\big|<(\log N)^{-E} \end{equation*} is solvable in prime variables such that each of the numbers has, counted according to multiplicity, at most prime factors, which constitutes a large improvement upon the previous results of Dimitrov [13] and Li-Xue-Zhang [22], respectively.

生成讲解博客的中文版本

生成AI智能校验的中文版本