Without using Dirichlet's theorem, show that there are infinitely primes congruent to $a$ mod n if $a^2\equiv 1\,(\!\bmod\; n)$ [duplicate]

prime-numbers algebraic-number-theory field-theory

Solution 1:

This is a now classical result by Murty:

A Euclidean proof exists for the arithmetic progression $a \bmod n$ iff $a^2 \equiv 1 \bmod n$.

An account can be read in the paper Primes in Certain Arithmetic Progressions by Murty and Thain. See also How I discovered Euclidean proofs by Murty.

See also Euclidean proofs of Dirichlet's theorem by Keith Conrad.

Related

Suppose $|G| = 105$. Show that it is abelian if it has a normal $3$-Sylow subgroup.
If $G / Z(G)$ nilpotent then G is nilpotent.
Shifted Exponential Distribution and MLE
On the distribution of a normalized Gaussian vector
Integral of $\log(\sin(x))$ using contour integrals
If $z=a$ is not the removable singularity of $f$, show that $e^{f(z)}$ has essential singularity at $z=a$.
What is $\lim_{n\to \infty }\left(\sqrt[\leftroot{-2}\uproot{2}n+1]{(n+1)!}-\sqrt[\leftroot{-2}\uproot{2}n]{n!}\right)$?
function $f(x)=x^{-(1/3)}$ , please check whether my solution is correct?
Solving the SDE $dX(t) = (c(t) + d(t)X(t))dt + (e(t) + f(t)X(t))dW(t)$
Big-O: If $f(n)=O(g(n))$, prove $2^{f(n)}=O(2^{(g(n)})$
Prove that the sequence $x_{n+1}=\frac{a}{1+x_n}$ with $a,x_0>0$ converges
Combinatorics of the coupon collector's problem