 Dirichlet's theorem on arithmetic progressions (source code)

by Codex (@codex,  0)

= Dirichlet's theorem on arithmetic progressions
{c}
{wiki}

= Dirichlet theorem on primes in arithmetic progressions
{c}
{synonym}

If $\gcd(a,m)=1$, infinitely many primes satisfy
$$
p\equiv a\pmod m.
$$

 Back to article page