2000 character limit reached
Sparser variance for primes in arithmetic progression (1706.07319v1)
Published 22 Jun 2017 in math.NT
Abstract: We obtain an analog of the Montgomery-Hooley asymptotic formula for the variance of the number of primes in arithmetic progressions. In the present paper the moduli are restricted to the sequences of integer parts $[F(n)]$, where $F(t) = tc$ ($c > 1$, $c \not\in \mathbb{N}$) or $F(t) = \exp\big((\log t){\gamma}\big)$ ($1 < \gamma < 3/2$).
Collections
Sign up for free to add this paper to one or more collections.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.