Let a ∈ Z and suppose that the congruence $x ^2 ≡ a \mod p$ can be solved for all primes p except possibly finitely many, then a is square .
If $n\in\Bbb Z^+$ is not a square, prove exist infinitely many primes $p$ such that $\left(\frac{n}{p}\right)=-1$.