Homepage › Solution manuals › Ivan Niven › An Introduction to the Theory of Numbers › Exercise 2.9.2 (Number of solutions modulo $p$)
Exercise 2.9.2 (Number of solutions modulo $p$)
Suppose that , and that . Show that if is an odd prime, , then has exactly one solution. Show that if is an odd prime, , then the congruence has either or solutions, and that if is a solution then .
Answers
Proof. Since is odd, has an inverse modulo , which we write , and since , has an inverse modulo , which we write (i.e. ).
Then
(We may write this more readably ).
Since is prime, and ,
-
If
,
Therefore the equation has exactly one solution modulo , which is (this is the root of modulo ).
- If and is not a square modulo (i.e. ), then the equation (1) has no solution.
-
If
and
is a square modulo
(i.e.
), then
for some integer
, and
Therefore the equation has two solutions modulo , which are . Since , then , thus these solutions are distinct modulo .
If is such a solution, , since . □