Gaps of Smallest Possible Order between Primes in an Arithmetic Progression

preprint2016arXivOpen access

Abstract

Let t∈Nt \in \mathbb{N}, η>0η>0. Suppose that xx is a sufficiently large real number and qq is a natural number with q≤x5/12−ηq \leq x^{5/12-η}, qq not a multiple of the conductor of the exceptional character χ∗χ^* (if it exists). Suppose further that, max⁡{p:p∣q}<exp⁡(log⁡xClog⁡log⁡x)    and    ∏p∣qp<xδ, \max \{p : p | q \} < \exp (\frac{\log x}{C \log \log x}) \; \; {and} \; \; \prod_{p | q} p < x^δ, where CC and δδ are suitable positive constants depending on tt and ηη. Let a∈Za \in \mathbb{Z}, (a,q)=1(a,q)=1 and A={n∈(x/2,x]:n≡a(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 pt−p1≪qtexp⁡(40t9−20θ). p_t - p_1 \ll qt \exp (\frac{40 t}{9-20 θ}) . Here θ=(log⁡q)/log⁡xθ= (\log q) / \log x.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.