arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1802.00085math.NT
收藏

算术进展中素数的显式界限

Explicit bounds for primes in arithmetic progressions

University of British Columbia(不列颠哥伦比亚大学);City University of New York, College of Staten Island and The Graduate Center(纽约市立大学,斯塔滕岛学院及研究生院)

Michael A. Bennett, Greg Martin, Kevin O'Bryant, Andrew Rechnitzer

AI总结:

该研究推导了算术进展中素数计数函数的显式上界,并改进了L(1,χ)和例外零点的界。

摘要:

我们推导了各种计数算术进展中素数函数的显式上界。例如,若q和a为整数,且gcd(a,q)=1,且3≤q≤10^5,θ(x;q,a)表示所有满足p≡a mod q且p≤x的素数的对数之和,我们证明对于所有x≥8×10^9(对于个别这样的模数q,可以得到更紧的常数),有|θ(x;q,a) - x/ϕ(q)| < 1/160 * x/log x。我们还建立了其他标准素数计数函数π(x;q,a)和ψ(x;q,a)的相同形状的不等式,以及当q≤1200时,第n个同余于a mod q的素数的不等式。对于模数q>10^5,我们发现甚至更强的显式不等式,但只适用于x值更大的情况。在此过程中,我们还得到了二次特征χ的L(1,χ)的改进显式下界,以及例外零点的改进显式上界。

英文摘要:

We derive explicit upper bounds for various functions counting primes in arithmetic progressions. By way of example, if $q$ and $a$ are integers with $\gcd(a,q)=1$ and $3 \leq q \leq 10^5$, and $θ(x;q,a)$ denotes the sum of the logarithms of the primes $p \equiv a \pmod{q}$ with $p \leq x$, we show that $$ \bigg| θ(x; q, a) - \frac{x}{ϕ(q)} \bigg| < \frac1{160} \frac{x}{\log x}, $$ for all $x \ge 8 \cdot 10^9$ (with sharper constants obtained for individual such moduli $q$). We establish inequalities of the same shape for the other standard prime-counting functions $π(x;q,a)$ and $ψ(x;q,a)$, as well as inequalities for the $n$th prime congruent to $a\pmod q$ when $q\le1200$. For moduli $q>10^5$, we find even stronger explicit inequalities, but only for much larger values of $x$. Along the way, we also derive an improved explicit lower bound for $L(1,χ)$ for quadratic characters $χ$, and an improved explicit upper bound for exceptional zeros.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑