arXiv · 1706.07319
Sparser variance for primes in arithmetic progression
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) = t^c$ ($c > 1$, $c \not\in \mathbb{N}$) or $F(t) = \exp\big((\log t)^{\gamma}\big)$ ($1 < \gamma < 3/2$).
Explore related subjects
Keep this discovery
Roger Baker, Tristan Freiberg. 2017-06-22. Sparser variance for primes in arithmetic progression. https://doi.org/10.1007/s00605-017-1139-6
Cite the original work for its findings. Save a collection to share your selection of sources.