Primes in short arithmetic progressions
Number Theory
2011-05-10 v1
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.
Cite
@article{arxiv.1105.1623,
title = {Primes in short arithmetic progressions},
author = {Jan-Christoph Schlage-Puchta},
journal= {arXiv preprint arXiv:1105.1623},
year = {2011}
}