Exercise 4.10

Show that the sum of all the primitive roots modulo p is congruent to μ ( p − 1 ) modulo p .

Answers

Proof. Notation: 𝔽 p = ℤ ∕ pℤ is the field with p elements, | x | the multiplicative order of an element x ∈ 𝔽 p ∗ , ℕ ∗ = { 1 , 2 , 3 , … } .

Let

ψ : { ℕ ∗ → 𝔽 p n ↦ ψ ( n ) = ∑ d ∈ 𝔽 p ∗ , | d | = n d ,

so that ψ ( n ) is the sum of the elements with order n in 𝔽 p ∗ . So ψ ( n ) = 0 if n ∤ p − 1 , and S = ψ ( p − 1 ) is the sought sum of all the primitive roots modulo p .

We compute for all n ∈ ℕ ∗

f ( n ) = ∑ d ∣ n ψ ( d ) .

f ( n ) is the sum of elements whose order divides n , in other worlds the sum of the roots of x n − 1 . This sum is, up to the sign, the coefficient of x n − 1 , so is null, except in the case n = 1 , where the sum of the unique root 1 of x − 1 is 1 . So

f ( 1 ) = 1 , ∀ ⁡ n > 1 , f ( n ) = 0 ,

( f = χ { 1 } is the characteristic function of { 1 } ).

From the Möbius inversion formula, for all n ∈ ℕ ∗ , ψ ( n ) = ∑ ⁡ d ∣ m μ ( n d ) f ( d ) , so

ψ ( p − 1 ) = ∑ d ∣ p − 1 μ ( p − 1 d ) f ( d ) = μ ( p − 1 ) .

Conclusion :

S = ∑ d ∈ 𝔽 p ∗ , | d | = p − 1 d = μ ( p − 1 ) :

the sum of all the primitive roots modulo p is congruent to μ ( p − 1 ) modulo p . □

User profile picture
2022-07-19 00:00
Comments