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 p be a prime and let n be a positive integer. Find the order of p ¯ in ( ( p n 1 ) ) × and deduce that n φ ( p n 1 ) (here φ is Euler’s function).

Answers

Proof. Since p ( p n 1 ) = 1 , p ¯ ( ( p n 1 ) ) × . The order of ( ( p n 1 ) ) × is

| ( ( p n 1 ) ) × | = φ ( p n 1 ) .

Let k + . Then

p n 1 p k 1 n k . (1)

Indeed,

  • If n k , then k = 𝑞𝑛 for some integer q , thus

    p k 1 = p 𝑞𝑛 1 = ( p n 1 ) ( p ( q 1 ) n + p ( q 2 ) n + + p n + 1 ) ,

    therefore p n 1 p k 1 .

  • Conversely suppose that p n 1 p k 1 . Write k = 𝑞𝑛 + r , where 0 r < n . Then

    p k 1 = p r ( p 𝑞𝑛 1 ) + p r 1 .

    Since p n 1 p k 1 and p n 1 p 𝑞𝑛 1 , then p n 1 p r 1 , where 0 p r 1 < p n 1 , hence p r 1 = 0 , thus r = 0 and n k .

So the equivalence (1) is proven. This shows that for all k + ,

p ¯ n = 1 ¯ p n 1 p k 1 n k .

Since | p ¯ | is the smallest positive integer k such that p ¯ k = 1 , we obtain

| p ¯ | = n .

The order of p ¯ in ( ( p n 1 ) ) × is n .

Moreover, by Lagrange’s Theorem, the order of p ¯ divides | ( ( p n 1 ) ) × | = φ ( p n 1 ) . Therefore, if p is a prime and n > 0 ,

n φ ( p n 1 ) .

User profile picture
2025-12-06 12:53
Comments