Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
134 tokens/sec
GPT-4o
10 tokens/sec
Gemini 2.5 Pro Pro
47 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Gaps of Smallest Possible Order between Primes in an Arithmetic Progression (1412.0574v4)

Published 1 Dec 2014 in math.NT

Abstract: 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$.

Summary

We haven't generated a summary for this paper yet.