arXiv Analytics

Sign in

arXiv:1412.0574 [math.NT]AbstractReferencesReviewsResources

Gaps of Smallest Possible Order between Primes in an Arithmetic Progression

Roger C. Baker, Liangyi Zhao

Published 2014-12-01Version 1

Let $t \in \mathbb{N}$, $\eta >0$. Suppose that $x$ is a sufficiently large real number and $q$ is a natural number with $q \leq x^{5/12-\eta}$, $q$ not a multiple of the conductor of the exceptional character $\chi^*$ (if it exists). Suppose further that, \[ \max \{p : p | q \} < \exp (\frac{\log x}{C \log \log x}) \; \; {and} \; \; \prod_{p | q} p < x^{\delta}, \] where $C$ and $\delta$ are suitable positive constants depending on $t$ and $\eta$. Let $a \in \mathbb{Z}$, $(a,q)=1$ and \[ \mathcal{A} = \{n \in (x/2, x]: n \equiv a \pmod{q} \} . \] We prove that there are primes $p_1 < p_2 < ... < p_t$ in $\mathcal{A}$ with \[ p_t - p_1 \ll qt \exp (\frac{40 t}{9-20 \theta}) . \] Here $\theta = (\log q) / \log x$.

Related articles: Most relevant | Search more
arXiv:2001.08634 [math.NT] (Published 2020-01-20)
When the Nontrivial, Small Divisors of a Natural Number are in Arithmetic Progression
arXiv:1912.11587 [math.NT] (Published 2019-12-25)
When the Large Divisors of a Natural Number Are in Arithmetic Progression
arXiv:1706.07319 [math.NT] (Published 2017-06-22)
Sparser variance for primes in arithmetic progression