Homepage Solution manuals David S. Dummit Abstract Algebra Exercise 0.3.10 ($|(\mathbb{Z}/n\mathbb{Z})^\times| = \varphi(n)$)

Exercise 0.3.10 ($|(\mathbb{Z}/n\mathbb{Z})^\times| = \varphi(n)$)

Prove that the number of elements of ( 𝑛ℤ ) × is φ ( n ) where φ denotes the Euler φ -function.

Answers

Let a b denote the g.c.d of a and b .

Proof. If n = 1 , then 𝑛ℤ = 1 = { 1 ¯ } , and ( 1 ) × = { 1 ¯ } , so φ ( 1 ) = 1 = | ( 𝑛ℤ ) × | . We may assume now that n > 1 .

We first prove that for all k ,

k ¯ ( 𝑛ℤ ) × k n = 1 . (1)
  • If k ¯ ( 𝑛ℤ ) × , then there is some class l ¯ , where l , such that k ¯ l ¯ = 1 ¯ , therefore 𝑘𝑙 1 = 𝑞𝑛 for some integer q . The Bézout’s relation 𝑘𝑙 𝑞𝑛 = 1 shows that k n = 1 (If a k and a n , then a 𝑘𝑙 𝑞𝑛 = 1 ).
  • Conversely, if k n = 1 , the Bézout’s Theorem shows that there are integers u and v such that 𝑢𝑘 + 𝑣𝑛 = 1 . Therefore 𝑢𝑘 1 ( 𝑚𝑜𝑑 n ) , thus u ¯ k ¯ = 1 ¯ , so k ¯ ( 𝑛ℤ ) ×

So (1) is proven.

Consider the map

ψ { { k [ [ 0 , n [ [ k n = 1 } ( 𝑛ℤ ) × k k ¯ .

  • ψ is correctly defined, because by the equivalence (1), if k n = 1 , then k ¯ ( 𝑛ℤ ) × .
  • ψ is surjective: If c ( 𝑛ℤ ) × , then by Exercise 2, there is some k [ [ 0 , n [ [ such that k ¯ = c ,and by the equivalence (1), k n = 1 , so ψ ( k ) = c .
  • ψ is injective. If ψ ( i ) = ψ ( j ) , then i ¯ = j ¯ , where 0 i < n and 0 j < n . By Exercise 2, i = j .

So ψ is a bijection, and

| ( 𝑛ℤ ) × | = Card { k [ [ 0 , n [ [ k n = 1 } = φ ( n ) .

(Since n > 1 , n n = n 1 , and 0 n = n 1 , so

{ k [ [ 0 , n [ [ k n = 1 } = { k [ [ 1 , n ] ] k n = 1 }

has cardinality φ ( n ) by definition.)

The number of elements of ( 𝑛ℤ ) × is φ ( n ) . □

User profile picture
2026-01-07 10:46
Comments