Dirichlet's Theorem on Primes in Arithmetic Progressions

The theorem that any arithmetic progression a, a+d, a+2d, ... with gcd(a,d)=1 contains infinitely many prime numbers; it guarantees at least one prime in infinitely many positions of the progression when the initial term and modulus are coprime.