Hey guys,

in our NT course we have the topic arithmetic progressions and we had to prove that there are infinitely many primes in the progressions $\displaystyle 4n + 3$ and $\displaystyle 4n + 1$.

Now the task says to find more arithmetic progressions containing infinitely primes. Our professor said at some point that every arithmetic progression(a. p.) contains infinitely many primes, but is it also possible to find a non-difficult proof that there are infinitely many a. p. with infinitely many primes? I thought about $\displaystyle 8n + 1$, $\displaystyle 8n + 3$ ... but the proof for the cases $\displaystyle 4n + 1$ and $\displaystyle 4n + 3$ were a bit longer, is there a possibility to generalize them for $\displaystyle 2^k*n + 1$?

I would be thankful for any help I can get.