# Theorem of Primes in Arithmetic Progression [duplicate]

I'm am studying number theory and I came across this theorem by Dirichlet but the proof is not given and I do not know how to prove it

Can anyone help me?

$Theorem$ $of$ $Primes$ $in$ $Arithmetic$ $Progression:$ If $a$ and $b$ are integers, with $(a,b)=1$ so the arithmetic progression $an+b$, $n=1,2,3,...$ has infinite primes.

## marked as duplicate by davidlowryduda♦Oct 20 '17 at 5:24

• This is not an easy result! In certain cases, such as $4n+3$, there are ways to get at it but the general theorem requires a lot of machinery. – lulu Jul 3 '17 at 18:48
• In general, the idea is that $F(s) =\displaystyle \sum_{p^k \text{ prime power }, p^k \equiv b \bmod a} p^{-sk}$ has the nice property that $F(s) =\frac{1}{\phi(a)} \sum_{\chi \bmod a} \overline{\chi(b)} \log L(s,\chi)$ where $L(s,\chi) = \sum_{n=1}^\infty \chi(n) n^{-s}$ are the Dirichlet L-functions. And hence to prove Dirichlet's theorem it is enough to prove $F(s)$ is not analytic at $s=1$. – reuns Jul 3 '17 at 20:16