# Tag Info

When $(a,m) = 1$, let $\pi(x;a \bmod m)$ be the number of primes $p\leq x$ such that $p \equiv a \bmod m$. The prime number theorem for arithmetic progressions mod $m$ says for all \$a \in (\mathbf Z/m\...