arXiv Analytics

Sign in

arXiv:2208.11123 [math.NT]AbstractReferencesReviewsResources

An explicit version of Bombieri's log-free density estimate

Jesse Thorner, Asif Zaman

Published 2022-08-23Version 1

We make explicit Bombieri's refinement of Gallagher's log-free "large sieve density estimate near $\sigma = 1$" for Dirichlet $L$-functions. We use this estimate and recent work of Green to prove that if $N\geq 2$ is an integer, $A\subseteq\{1,\ldots,N\}$, and for all primes $p$ no two elements in $A$ differ by $p-1$, then $|A|\ll N^{1-1/10^{18}}$. This strengthens a theorem of S{\'a}rk{\"o}zy. Also, for integers $q\geq 3$ and $a$ such that $\gcd(a,q)=1$, we prove a highly uniform and explicit version of the prime number theorem that nontrivially counts primes $p\leq x$ such that $p\equiv a\pmod{q}$ when $x\geq \max\{q,411\}^{150\,000}$.

Related articles: Most relevant | Search more
arXiv:2301.13457 [math.NT] (Published 2023-01-31)
The prime number theorem for primes in arithmetic progressions under the Generalised Riemann Hypothesis
arXiv:1906.09906 [math.NT] (Published 2019-06-18)
On Littlewood's proof of the prime number theorem
arXiv:2202.01837 [math.NT] (Published 2022-02-03)
Oscillation of the remainder term in the prime number theorem of Beurling, "caused by a given zeta-zero"