Modular Arithmetichard
0:00.0

Let n=p1p2n = p_1 p_2 be a product of two distinct odd primes. If x2a(modn)x^2 \equiv a \pmod{n} is solvable, what is the maximum number of solutions to the congruence?