加载中…
It is proved that where denote the number of zeros of in the rectangle , . The exponent improves upon Huxley’s earlier exponent of . The key innovation lies in deriving a sharp upper bound for sums involving affine transformations with GCD twists, which emerges from our application of the Guth-Maynard method. As corollaries, we obtain two new arithmetic consequences from this zero-density estimate: first, a result concerning the least prime in arithmetic progressions when the modulus is a prime power; second, a result on the least Goldbach number in arithmetic progressions when the modulus is prime.

生成讲解博客的中文版本

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