Homepage Solution manuals Ivan Niven An Introduction to the Theory of Numbers Exercise 2.3.9 (For what values of $n$ is $\phi(n)$ odd?)

Exercise 2.3.9 (For what values of $n$ is $\phi(n)$ odd?)

For what values of n is ϕ ( n ) odd?

Answers

Proof. First solution.

If n > 1 , then n as a prime factor p , and n is divisible by p α , where α 1 .

Then ϕ ( n ) is divisible by p α p α 1 = p α 1 ( p 1 ) .

If p is odd, then 2 p 1 , and p 1 ϕ ( n ) , so ϕ ( n ) is even.

If p = 2 , then 2 α 2 α 1 = 2 α 1 divides ϕ ( n ) . If α 2 , then 2 2 α 1 and 2 α 1 ϕ ( n ) , so ϕ ( n ) is even.

It remains only n = 1 or n = 2 , for which ϕ ( n ) = 1 is odd.

To conclude, ϕ ( n ) is odd only for the values n = 1 or n = 2 .

Second solution.

Consider , for n 2 , the map

f { ( nℤ ) × ( nℤ ) × [ i ] n [ n i ] n ,

where ( nℤ ) × is the group of invertible elements of nℤ , whose order is ϕ ( n ) .

This makes sense, since i n = 1 ( i n ) n = 1 , thus f ( [ i ] n ) ( nℤ ) × .

Since i = n ( n i ) , f f = 1 ( nℤ ) × , so f is an involution.

We search the fixed points of this involution. If f ( [ i ] n ) = [ i ] n , where [ i ] n ( nℤ ) × , then i n i ( mod n ) , thus

2 i 0 ( mod n ) .

  • If n is odd, then i 0 ( mod n ) , so [ i ] n = 0 and then [ i ] n ( nℤ ) × : this is a contradiction.
  • If n is even, i 0 ( mod n 2 ) , thus gcd ( i , n ) = n 2 > 1 and then [ i ] n ( nℤ ) × . Contradiction again.

Therefore f is an involution without fixed point. We can partition ( nℤ ) × in pairs { c , f ( c ) } for c ( nℤ ) × , where f ( c ) c , thus

2 ϕ ( n ) = | ( nℤ ) × |  if  n > 2 .

User profile picture
2024-08-11 16:44
Comments