Quadratic residue mod p
85287
Prove that, for $p > 3$, $(\frac 3p) = 1$ when $p \equiv 1,11 \pmod{12}$ and $(\frac 3p) = -1$ when $p \equiv 5,7 \pmod{12}$
49649
How can I find out whether a number is a quadratic residue in a large modulo?
115758
Remainder of division when $p$ is not prime
93328
$\mathbb{F}_p[X]/(X^2+X+1)$ is a field iff $p \equiv 2 \bmod 3$
131731
Primes that can't be written as sum of two squares. Mod
99316
Multivariate Residue Theorem?
34430
Why does $(\frac{p-1}{2}!)^2 = (-1)^{\frac{p+1}{2}}$ mod $p$?
153647
Elementary number theory and quadratic
44033
Number theory lemma - $x^2 \equiv 1 \pmod p$ implies $x\equiv\pm 1\pmod p$
4972
Mod of numbers with large exponents [modular order reduction]
151764
modular arithmetic, solving $ax + b \equiv c \pmod d$?
146851
Prove that $-3$ is a quadratic residue mod an odd prime $>3$ if and only if $p$ is of the form of $6n+1$
155012
Solving quadratic equations in modular arithmetic
60305
Proving the congruence $p^{q-1}+q^{p-1} \equiv 1 \pmod{pq}$
94017
If p is a prime and a ∈Z. How do we prove that the congruence x^x ≡ a (mod p) is solvable?
52530
There exists a prime congruent to $m$ mod $p$
96816
The residue at $\infty$