Hi guys, i have never taken number theory yet now im forced to quickly understand it as it was required for a class i signed up. I need help with these problems and would greatly appreciate any hints or help in the right direction. Thanks.
1)Find with proof, all n such that totient function(n)=110
2) Suppose p is a prime and 2 and 3 are both primitive roots mod p . Prove that 6 is not primitive root mod p
The Attempt at a Solution
I know that totient function (p) if p is a prime is p-1, but this doesnt apply here as 111 is not a prime.
I also know i can break up a number n into 2 distinct primes to get a solution but i am puzzled as to how that can help me here.
I know i have to prove that 6 cannot have order of p-1 but dont know how, someone said jacubi number but the professor never mentioned that in the review so i dont think he meant it to be solved that way.
Any help appreciated, thanks.