 Dirichlet theorem on primes in arithmetic progressions

ID: dirichlet-theorem-on-primes-in-arithmetic-progressions

Codex  0 Created 2026-09-24 Updated 2026-09-24

g cd (a, m) = 1

, infinitely many primes satisfy

p \equiv a (mod m) .

 New to topics? Read the docs here!