gcd(a,d)=1 ⟹ infinitely many primes p ≡ a (mod d). Proof via L(s,χ) non-vanishing at s=1. Dirichlet 1837.