Modular Arithmeticmedium
0:00.0

Consider the congruence x2a(modp)x^2 \equiv a \pmod{p}. If the Legendre symbol \left( \frac{a}{p} ight) = -1, what can we conclude about the number of solutions for xx?