关于Brun-Titchmarsh定理
On the Brun-Titchmarsh Theorem
摘要:
Brun-Titchmarsh定理表明,对于依赖于$\log{x}/\log{q}$的某个值$C$,与$a\pmod{q}$全等的素数$\le x$的个数为$\le (C+o(1))x/(ϕ(q)\log{x})$.不同的作者在不同的范围内为$\log{x}/\log{q}$提供了不同的$C$估计值,所有这些都给出了$C>2$。我们证明了只要$\log{x}/\log{q}\ge 8$ .在不排除特殊西格尔零的可能性的情况下,我们不可能有$C<2$,因此这个结果在这个意义上是最好可能的。我们得到了这个结果使用的分析方法中开发的林尼克常数的研究。特别地,我们得到了实部接近1,虚部虚部为O(1)的Dirichlet $L$ -函数零点个数的显式界.
英文摘要:
The Brun-Titchmarsh theorem shows that the number of primes $\le x$ which are congruent to $a\pmod{q}$ is $\le (C+o(1))x/(ϕ(q)\log{x})$ for some value $C$ depending on $\log{x}/\log{q}$. Different authors have provided different estimates for $C$ in different ranges for $\log{x}/\log{q}$, all of which give $C>2$. We show that one can take C=2 provided that $\log{x}/\log{q}\ge 8$. Without excluding the possibility of an exceptional Siegel zero, we cannot have $C<2$ and so this result is best-possible in this sense. We obtain this result using analytic methods developed in the study of Linnik's constant. In particular, we obtain explicit bounds on the number of zeroes of Dirichlet $L$-functions with real part close to 1 and imaginary part of size O(1).
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。