Homepage › Solution manuals › David S. Dummit › Abstract Algebra › Exercise 3.2.17 ($n \mid \varphi(p^n - 1)$)
Exercise 3.2.17 ($n \mid \varphi(p^n - 1)$)
Let be a prime and let be a positive integer. Find the order of in and deduce that (here is Euler’s function).
Answers
Proof. Since , . The order of is
Let . Then
Indeed,
-
If , then for some integer , thus
therefore .
-
Conversely suppose that . Write , where . Then
Since and , then , where , hence , thus and .
So the equivalence (1) is proven. This shows that for all ,
Since is the smallest positive integer such that , we obtain
The order of in is .
Moreover, by Lagrange’s Theorem, the order of divides . Therefore, if is a prime and ,
□