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

Which of these integers nnn makes the congruence x2≡−1(modn)x^2 \equiv -1 \pmod{n}x2≡−1(modn) solvable?