1
$\begingroup$

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.

$\endgroup$
  • $\begingroup$ There are informative answers at this MO-question. $\endgroup$ – Dietrich Burde Nov 5 '17 at 12:25
  • $\begingroup$ @DietrichBurde I don't want the proof of Dirichlet's theorem, I want how should we go about proving it for a certain form like $7k+3$ for eg. $\endgroup$ – john doe Nov 5 '17 at 12:28
  • $\begingroup$ You can use the "Euclidean proof" as in $4k+1$ etc. , if and only if Murty's criterion is met, see my answer. So the answer is, that you must use more analytic arguments involving $L$-series for cases like $7k+3$. Of course, all cases follow from Dirichlet's Theorem anyway. $\endgroup$ – Dietrich Burde Nov 5 '17 at 12:29
3
$\begingroup$

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.

$\endgroup$
  • $\begingroup$ Thanks for the added reference $\endgroup$ – john doe Nov 5 '17 at 12:31
  • $\begingroup$ The introduction of this references discusses exactly what you have asked, if I understood correctly. $\endgroup$ – Dietrich Burde Nov 5 '17 at 12:33
  • $\begingroup$ Yes, that was very specific to my query $\endgroup$ – john doe Nov 5 '17 at 12:35
  • 1
    $\begingroup$ Very good :) :) $\endgroup$ – Dietrich Burde Nov 5 '17 at 12:37

Your Answer

By clicking "Post Your Answer", you agree to our terms of service, privacy policy and cookie policy

Not the answer you're looking for? Browse other questions tagged or ask your own question.