Primes in short arithmetic progressions

The Siegel-Walfisz theorem gives an asymptotic estimate for the number of primes in an arithmetic progression, provided the modulus of the progression is small in comparison with the length of the progression. Counting primes is harder when the modulus is not so small compared to the length, but estimates such as Linnik's constant and the Brun-Titchmarsh theorem give us some information. We aim to look in particular at upper bounds for the number of primes in such a progression, and improving the Brun-Titchmarsh bound.