Homepage › Solution manuals › Ivan Niven › An Introduction to the Theory of Numbers › Exercise 4.4.20* ($U_p \equiv (D/p) \pmod p$)
Exercise 4.4.20* ($U_p \equiv (D/p) \pmod p$)
Show that if is an odd prime then .
Answers
First proof (in the style of Lucas and NZM).
Proof. By the proof of Theorem 4.12, for all ,
In particular, for ,
By Fermat’s theorem, . Moreover if , so that all terms except the last are congruent to modulo . This gives
□
Second proof (in my style).
Proof. As in the second solution of Problem 19, consider the sequences defined for all by , so that
-
If , then has a square root in , and the polynomial has two distinct roots and , so that
In particular
where by Fermat’s theorem, thus . This gives
-
If , then has a square root in some quadratic extension of , for instance , where is irreducible over . If and are the distinct roots of in , then , and is a field with elements. Then by induction,
remain true. In particular
Consider the map
Since the characteristic of is , is an automorphism of the field , named Frobenius automorphism, and for all , if .
Moreover, since for all , , so .
The remarkable fact is that exchanges and :
Indeed, since , thus , thus is a root of , so . But the only elements of fixed by are the elements of , otherwise the polynomial , of degree , would have more than roots. Since , , so , and , so (7) is proven.
This gives by definition of ,
By (6),
Thus
-
If , then . By induction, using (1), where , we obtain for all ,
where is the unique root of , that is .
In particular
This gives
In all cases
□