Guest Session: 1 Question Remaining. Create Account to save progress.
Login
Modular Arithmetichard
0:00.0

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