Ononot — Which of these integers n makes the congruence x^2 \equiv -1

Guest Session: 1 Question Remaining. Create Account to save progress.

Modular Arithmeticmedium

0:00.0

Which of these integers $n$ makes the congruence $x^2 \equiv -1 \pmod{n}$ solvable?