Ononot — What is the smallest positive integer n such that the congru

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

Modular Arithmeticmedium

0:00.0

What is the smallest positive integer $n$ such that the congruence $x^2 \equiv -1 \pmod{n}$ is solvable?