Homepage › Solution manuals › Ivan Niven › An Introduction to the Theory of Numbers › Exercise 3.2.6 ($x^2 \equiv 150 \pmod{1009}$ is solvable)
Exercise 3.2.6 ($x^2 \equiv 150 \pmod{1009}$ is solvable)
Decide wether is solvable or not.
Answers
Proof. Since ,
thus
Therefore is solvable (the two solutions are ). □
2024-10-23 08:22