Homepage Solution manuals Ivan Niven An Introduction to the Theory of Numbers Exercise 4.3.24* ($\prod\limits_{\underset{(a,n) = 1}{a=1}}^n a = n^{\phi(n)} \prod_{d \mid n} (d!/d^d)^{\mu(n/d)}$)

Exercise 4.3.24* ($\prod\limits_{\underset{(a,n) = 1}{a=1}}^n a = n^{\phi(n)} \prod_{d \mid n} (d!/d^d)^{\mu(n/d)}$)

Show that a = 1 ( a , n ) = 1 n a = n ϕ ( n ) d n ( d ! d d ) μ ( n d )

Answers

Proof. We define

f ( n ) = a [ [ 1 , n ] ] , a n = 1 a n , F ( n ) = d n f ( d ) .

Since this product has ϕ ( n ) factors,

f ( n ) = n ϕ ( n ) a [ [ 1 , n ] ] , a n = 1 a . (1)

Consider the set An of fractions x of the form x = k n , where 1 k n :

A n = { x k [ [ 1 , n ] ] , x = k n } = { 1 n , 2 n , , n n } .

Consider also the set B n of fractions x of the form x = a d , where d n and 1 a d :

B n = { x a , d , d n  and  1 a d } .

We show that A n = B n .

If x A n , then x = k n , where 1 k n , thus 0 < x 1 . Put δ = k n . Then there are integers a and d such that k = δa , n = δd and a d = 1 . So x is equal to a reduced fraction x = a d , where a d = 1 and d n . Since 0 < x 1 , we have 1 a n , so x B .

Conversely, if x B n , then x = a d , where a d = 1 , d n and 1 a d , thus 0 < x 1 . Then n = qd for some integer q . Put k = qa . Then x = a d = k n . Since 0 < x 1 , we have 1 k n , so x A n .

The equality B n = A n gives x B n x = x A n x , so

d n a [ [ 1 , d ] ] , a d = 1 a d = 1 n 2 n n n = n ! n n .

By definition of f and F , this gives

F ( n ) = d n f ( d ) = n ! n n . (2)

Then the Möbius multiplicative inversion formula (Problem 23) and (2) give

f ( n ) = δ n F ( n δ ) μ ( δ ) = d n F ( d ) μ ( n d ) ( d = n δ ) = d n ( d ! d d ) μ ( n d ) .

This shows, using (1), that

n ϕ ( n ) a [ [ 1 , n ] ] , a n = 1 a = d n ( d ! d d ) μ ( n d ) ,

so

a [ [ 1 , n ] ] , a n = 1 a = n ϕ ( n ) d n ( d ! d d ) μ ( n d ) .

For every positive integer n , a = 1 ( a , n ) = 1 n a = n ϕ ( n ) d n ( d ! d d ) μ ( n d ) . □

User profile picture
2025-01-31 12:01
Comments