Ononot — Identify the condition for x^2 \equiv a \pmod{p} to be solva

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

Modular Arithmetichard

0:00.0

Identify the condition for $x^2 \equiv a \pmod{p}$ to be solvable where $p$ is an odd prime, according to Euler's Criterion.