Primes in short arithmetic progressions

From MaRDI portal



Abstract: We give a large sieve type inequality for functions supported on primes. As application we prove a conjecture by Elliott, and give bounds for short character sums over primes. The proves uses a combination of the large sieve and the Selberg sieve.












This page was built for publication: Primes in short arithmetic progressions

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