Homepage Solution manuals Ivan Niven An Introduction to the Theory of Numbers Exercise 4.3.22* ($\sum\limits_{ m \in \mathbb{N}^*:\, \phi(m) = n} \mu(m) = 0$)

Exercise 4.3.22* ($\sum\limits_{ m \in \mathbb{N}^*:\, \phi(m) = n} \mu(m) = 0$)

For each positive integer n let ( n ) denote the set of those positive integers m such that ϕ ( m ) = n . Show that for every positive integer n , m ( n ) μ ( m ) = 0 .

Answers

Example: if n = 6 , then ( 6 ) = { 7 , 9 , 14 , 18 } , and

m ( n ) μ ( m ) = μ ( 7 ) + μ ( 9 ) + μ ( 14 ) + μ ( 18 ) = 1 + 0 + 1 + 0 = 0 .

Proof. By Problem 4.3.39, we know that ( n ) is a finite set, so the sum S n = m ( n ) μ ( m ) is finite.

( 1 ) = { 1 , 2 } , so S 1 = μ ( 1 ) + μ ( 2 ) = 0 . We suppose now that n > 1 . We note that

S = m ( n ) μ ( m ) = m ( n ) , μ ( m ) 0 μ ( m ) = m 𝒢 ( n ) μ ( m )

where

𝒢 ( n ) = { m ϕ ( m ) = n , μ ( m ) 0 } .

(For instance, 𝒢 ( 6 ) = { 7 , 14 } .)

If m 𝒢 ( n ) , then m is square-free, and m > 1 thus

m = p 1 p 2 p k , p 1 < p 2 < < p k ,

where p i is a prime number for every i , so p 1 = 2 if and only if m is even.

Moreover, if m 𝒢 ( n ) is odd, then 2 m = 2 p 1 p 2 p k is square-free, and

ϕ ( 2 m ) = ϕ ( 2 ) ϕ ( m ) = n ,

so 2 m 𝒢 ( n ) .

Conversely, if m 𝒢 ( n ) is even, then m = 2 m , where m is odd and square-free, and ϕ ( m ) = ϕ ( m ) , so m 𝒢 ( n ) .

Therefore we can group the terms of 𝒢 ( n ) by pairs { m , 2 m } , where m is odd, and

S = m 𝒢 ( n ) , m 1 [ 2 ] ( μ ( m ) + μ ( 2 m ) ) .

When m is odd,

μ ( m ) + μ ( 2 m ) = μ ( m ) + μ ( 2 ) μ ( m ) = μ ( m ) ( 1 + μ ( 2 ) ) = 0

Thus S = 0 .

For every positive integer n ,

m : ϕ ( m ) = n μ ( m ) = 0 .

User profile picture
2025-01-30 11:47
Comments