Exercise 2.3.42* (Solve $\phi(n) \mid n$)

Find all positive integers n such that ϕ ( n ) n .

Answers

Proof. Note that ϕ ( 1 ) = 1 1 . Assume now n > 1 , and write n = p 1 a 1 p k a k its decomposition in prime factors, where a i > 0 , k 1 and p 1 < p 2 < < p k . Then ϕ ( n ) n is equivalent to

p 1 a 1 1 ( p 1 1 ) p k a k 1 ( p k 1 ) p 1 a 1 p k a k .

Therefore

( p 1 1 ) ( p k 1 ) p 1 p k .

  • If k = 1 , then p 1 1 p 1 , which implies p 1 = 2 , and n = 2 i for some positive integer i .

    Conversely, if n = 2 i , i 1 , then ϕ ( n ) = 2 i 1 n .

  • If k > 1 , then one factor of ( p 1 1 ) ( p k 1 ) is even, so 2 p 1 p k . This implies that p 1 = 2 . Then

    ( p 2 1 ) ( p k 1 ) 2 p 2 p k ,

    where p 2 , , p k are odd primes.

    For every index i , 2 i k , p i 1 2 p 2 p k . Then p i 1 2 , or p i 1 p j for some index j . Since p j is prime and p i 2 , we obtain p i 1 = p j . This is impossible, since p i 1 is even, and p j odd. Therefore p i = 3 , and k = 2 , so n = 2 i 3 j , i > 0 , j > 0 .

    Conversely, if n = 2 i 3 j , i > 0 , j > 0 , then

    ϕ ( n ) = 2 i 1 3 j 1 2 = 2 i 3 j 1 2 i 3 j = n .

To conclude, n ϕ ( n ) if and only if n = 2 i for i 0 , or n = 2 i 3 j , where i > 0 , j > 0 . □

User profile picture
2024-08-17 10:16
Comments