Dirichlet theorem on primes in arithmetic progressions
= Dirichlet theorem on primes in arithmetic progressions
{c}
{wiki=Dirichlet's_theorem_on_arithmetic_progressions}
If $\gcd(a,m)=1$, infinitely many primes satisfy
$$
p\equiv a\pmod m.
$$
= Dirichlet theorem on primes in arithmetic progressions
{c}
{wiki=Dirichlet's_theorem_on_arithmetic_progressions}
If $\gcd(a,m)=1$, infinitely many primes satisfy
$$
p\equiv a\pmod m.
$$