Homepage Solution manuals Ivan Niven An Introduction to the Theory of Numbers Exercise 4.3.28* (The sum of the primitive $n$-th roots of unity is equal to $\mu(n)$)

Exercise 4.3.28* (The sum of the primitive $n$-th roots of unity is equal to $\mu(n)$)

Show that for each positive integer n , a = 1 ( a , n ) = 1 n e 2 πia n = μ ( n ) .

Answers

Here we must follow the hint of Problem 27.

Proof. By Problem 25, the primitive n -th roots ζ of unity are ζ = e 2 πia n , where 0 a < n and a n = 1 , and by Problem 26,

Φ n ( x ) = a [ [ 0 , n 1 ] ] , a n = 1 ( x e 2 πia n ) = d n ( x d 1 ) μ ( n d ) . (1)

If we expand Φ n ( x ) , then, writing δ = deg ( Φ n ( x ) ) = ϕ ( n ) ,

Φ n ( x ) = x δ σ 1 x δ 1 + + ( 1 ) k σ k x δ k + + ( 1 ) n σ δ ,

where the sum of the roots of Φ n ( x ) is given by

σ 1 = a [ [ 0 , n [ [ , a n = 1 e 2 πia n . (2)

It remains to compute the coefficient σ 1 of x δ 1 in Φ n ( x ) , using (1).

To find an asymptotic expansion of Φ n ( z ) in a neighborhood of , we compute the Taylor serie (limited development) of z δ Φ n ( 1 z ) of order 1 in a neighborhood of 0 .

First

Φ n ( 1 z ) = 1 z δ σ 1 1 z δ 1 + + ( 1 ) n σ δ ,

thus

z δ Φ n ( 1 z ) = 1 σ 1 z + o ( z ) . (3)

Next, by (1),

z δ Φ n ( 1 z ) = z δ d n ( 1 z d 1 ) μ ( n d ) = z δ d n ( n d ) d n ( 1 z d ) μ ( n d ) .

We know that d n ( n d ) = ϕ ( n ) = δ (by the Möbius inversion formula applied to n = d n ϕ ( d ) , or the comparison of the degrees in (1)). Therefore

z δ Φ n ( 1 z ) = d n ( 1 z d ) μ ( n d ) .

If d > 1 then 1 z d = 1 + o ( z ) , and if d = 1 , 1 z d = 1 z = 1 z + o ( z ) . Therefore

( 1 z d ) μ ( n d ) = { 1 + o ( z ) if  d > 1 , 1 μ ( n ) z + o ( z ) if  d = 1 .

Hence

z δ Φ n ( 1 z ) = 1 μ ( n ) z + o ( z ) . (4)

The comparison of (3) and (4) gives by the unicity of the coefficients in an expansion,

σ 1 = μ ( n ) .

Therefore (2) becomes

a [ [ 0 , n [ [ , a n = 1 e 2 πia n = μ ( n ) .

If n is a positive integer, the sum of the primitive n -th roots of unity is equal to μ ( n ) . □

User profile picture
2025-02-01 12:11
Comments