Number Theory and Modular Reasoning
Question 1 of 30
Time left:
00:00
How many incongruent solutions \(x \pmod{65}\) satisfy the congruence \(x^2 \equiv -1 \pmod{65}\)?
Select one option.
A
\(0\)
B
\(1\)
C
\(2\)
D
\(3\)
E
\(4\)
Submit
You have used 0 of 1 attempt
Show Explanation
Next
▶