English

Gaps of Smallest Possible Order between Primes in an Arithmetic Progression

Number Theory 2016-01-27 v4

Abstract

Let tNt \in \mathbb{N}, η>0\eta >0. Suppose that xx is a sufficiently large real number and qq is a natural number with qx5/12ηq \leq x^{5/12-\eta}, qq not a multiple of the conductor of the exceptional character χ\chi^* (if it exists). Suppose further that, max{p:pq}<exp(logxCloglogx)    and    pqp<xδ, \max \{p : p | q \} < \exp (\frac{\log x}{C \log \log x}) \; \; {and} \; \; \prod_{p | q} p < x^{\delta}, where CC and δ\delta are suitable positive constants depending on tt and η\eta. Let aZa \in \mathbb{Z}, (a,q)=1(a,q)=1 and A={n(x/2,x]:na(modq)}. \mathcal{A} = \{n \in (x/2, x]: n \equiv a \pmod{q} \} . We prove that there are primes p1<p2<...<ptp_1 < p_2 < ... < p_t in A\mathcal{A} with ptp1qtexp(40t920θ). p_t - p_1 \ll qt \exp (\frac{40 t}{9-20 \theta}) . Here θ=(logq)/logx\theta = (\log q) / \log x.

Keywords

Cite

@article{arxiv.1412.0574,
  title  = {Gaps of Smallest Possible Order between Primes in an Arithmetic Progression},
  author = {Roger C. Baker and Liangyi Zhao},
  journal= {arXiv preprint arXiv:1412.0574},
  year   = {2016}
}

Comments

18 pages