Monday, 30 November 2015

number theory - Find all ninmathbbZ+:phi(n)=4



I know that there is a similar post, but I m trying a different proof.
Also I will define P be the set of all positive prime numbers.



Question: If ϕ is Euler's Phi Fuction, we want to find all nZ+:ϕ(n)=4.



Answer: Let n=pn11...pnkkZ+ be the factorization of n in to primes. Then
ϕ(n)=pn111...pnk1k(p11)...(pk1)=4




So, i{1,2,...,k}pi1|4 . And from this, we have that



pi1{1,2,4}pi{2,3,5}P


Now, we can see the primes that n containts: n=2n13n25n3, n1,n2,n3Z+. So,
ϕ(2n13n25n3)=4ϕ(2n1)ϕ(3n2)ϕ(5n3)=4 ()



The possible cases for ni are:




  • n1=1,2,3ϕ(2)=1,ϕ(22)=2,ϕ(23)=4 respectively


  • n2=1ϕ(3)=2

  • n3=1ϕ(5)=4



All the posible combinations for the relation () are ϕ(5), ϕ(5)ϕ(2), ϕ(3)ϕ(22), ϕ(23). So, n{5,10,12,8}.



Is this completely right?



Thank you.


Answer




This seems to be completely correct to me.


No comments:

Post a Comment

real analysis - How to find limhrightarrow0fracsin(ha)h

How to find limh0sin(ha)h without lhopital rule? I know when I use lhopital I easy get $$ \lim_{h\rightarrow 0}...