Indexed metadata

A quaternary Diophantine inequality with prime numbers of a special form (II)

Yuhua Zhao, Jinjiang Li, Linji Long, Min Zhang

Source record

Source: arXiv

Published: Oct 20, 2026

arXiv: 2610.28774

Open original source ↗

Source abstract

Let NN be a sufficiently large real number. In this paper, it is proved that, for 101 0, the Diophantine inequality ∣p1c+p2c+p3c+p4c−N∣<(log⁡N)−E\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 p1,p2,p3,p4p_1,p_2,p_3,p_4 such that each of the numbers pi+2 (i=1,2,3,4)p_i+2\,(i=1,2,3,4) has, counted according to multiplicity, at most [312505179−3909c][\frac{31250}{5179-3909c}] prime factors, which constitutes a large improvement upon the previous results of Dimitrov [13] and Li-Xue-Zhang [22], respectively.

Evidence graph

No public relationships recorded yet.

Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.