Sparser variance for primes in arithmetic progression

From MaRDI portal




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, cotinmathbbN) or (1<gamma<3/2).









This page was built for publication: Sparser variance for primes in arithmetic progression

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q667801)