Homepage › Solution manuals › Ivan Niven › An Introduction to the Theory of Numbers › Exercise 2.9.3* (Number of solutions modulo $p^2$)
Exercise 2.9.3* (Number of solutions modulo $p^2$)
Let , and let be an odd prime that does not divide all the coefficients . Show that the congruence has either ,or solutions.
Answers
Note first that if , then
-
Assume first that
, and
. Then the equation
has two distinct solutions
modulo
(see Exercise 2.9.2). If
is a solution of
, then
, a fortiori
, thus
or
.
If , then , where . Since
we obtain
By Exercise 2.9.2, in the case , we know that . Therefore the equation has a unique solution .
We can conclude that the equation has two solutions modulo , which are , where , and .
-
Assume now that
, but
. Then the equation
has a unique solution
mod
, where
(see Exercise 2.9.2).
A solution of is of the form . Since for some , and , we obtain
If , there is no solution, and if any value of gives a solution, so that there are solutions distinct modulo .
-
if
, the equation
has a unique solution
. if
is a solution of
, then
for some integer
.
Since , this equation has exactly one solution modulo , which give a unique solution of .
- If , then , and the equation has no solution.
To conclude, the number of solutions modulo of is given by
where .