Homepage Solution manuals Ivan Niven An Introduction to the Theory of Numbers Exercise 4.3.13 ($\sum_{d \mid n} d \mu(d) = (-1)^{\omega(n)} \phi(n) \frac{s(n)}{n}$ where $s(n) = \sum_{p \mid n} p$)

Exercise 4.3.13 ($\sum_{d \mid n} d \mu(d) = (-1)^{\omega(n)} \phi(n) \frac{s(n)}{n}$ where $s(n) = \sum_{p \mid n} p$)

Let s ( n ) denote the largest square-free divisor of n . That is, s ( n ) = d n p . Show that d n ( d ) = ( 1 ) ω ( n ) ϕ ( n ) s ( n ) n .

Answers

Proof. If n = p 1 a 1 p 2 a 2 p l a l and m = q 1 b 1 q 2 b 2 q r b r are relatively prime, where p 1 , , p l , q 1 , q r are distinct prime, then nm = p 1 a 1 p 2 a 2 p l a l q 1 b 1 q 2 b 2 q r b r is the decomposition of nm in primes, so

s ( nm ) = p 1 p 2 p l q 1 q 2 q r = s ( n ) s ( m ) ,

so s is a multiplicative function.

We define for all positive integers n ,

F ( n ) = d n ( d ) , G ( n ) = ( 1 ) ω ( n ) ϕ ( n ) s ( n ) n .

Since μ , ϕ , s and n ( 1 ) ω ( n ) , n n are multiplicative functions, so are F and G .

Moreover F ( 1 ) = G ( 1 ) = 1 , and if α 1 ,

F ( p α ) = i = 0 α p i μ ( p i ) = 1 p ,

and

G ( p α ) = ( p α p α 1 ) p p α = 1 p .

Since F ( p α ) = G ( p α ) for all α 0 , where F and G are multiplicative, we obtain F = G .

For all positive integers n ,

d n ( d ) = ( 1 ) ω ( n ) ϕ ( n ) s ( n ) n .

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