Dirichlet 1837: for gcd(a, q)=1, infinitely many primes p ≡ a mod q; proof introduces Dirichlet L-functions L(s, chi) = sum chi(n)/n^s; foundational analytic-number-theory tool.
Dirichlet 1837: for gcd(a, q)=1, infinitely many primes p ≡ a mod q; proof introduces Dirichlet L-functions L(s, chi) = sum chi(n)/n^s; foundational analytic-number-theory tool.