I know by Dirichlet's theorem on arithmetic progressions that there are infinitely many primes of any type $a+nd$, where $a$ and $d$ are positive co-prime integers.
I come across many questions like - prove that there are infinitely many primes of form $4k+1, 6k+1, 6k+5, 8k+1,$ etc. where they use either quaratic residues or take some form of a number formed by the finite (assumed) set of primes of that form and then reach a contradiction.
I want to know how to tackle any such problem requiring to prove it for a certain form, it seems very non-trivial to me to begin.
A Euclidean proof, as for $4k+1,6k+1,6k+5,8k+1$ etc. is not always possible. In fact, we have the following Theorem:
Theorem 1. (Murty) A “Euclidean proof” exists for the arithmetic progression $l \bmod k$ if and only if $l^2 \equiv 1 \bmod k$.
Proof: See here.