In this post I will sketch a proof Dirichlet Theorem's in the following form: Theorem 1 (Dirichlet's Theorem on Arithmetic Progression) Let $latex \displaystyle \psi(x;q,a) = \sum_{\substack{n \le x \\ n \equiv a \mod q}} \Lambda(n). &fg=000000$ Let $latex {N}&fg=000000$ be a positive constant. Then for some constant $latex {C(N) > 0}&fg=000000$ depending on $latex… Continue reading Proof of Dirichlet’s Theorem on Arithmetic Progressions
Power Overwhelming 