Question

for n is a prime number then euler's phi function phi(n^2)​

Answer 1

Answer:

Euler's totient function is a multiplicative function, meaning that if two numbers m and n are relatively prime, then φ(mn) = φ(m)φ(n). This function gives the order of the multiplicative group of integers modulo n (the group of units of the ring ℤ/nℤ).

Explanation:

Answer 2

Answer:

n. phi(n)

Explanation:

since phi(n^2) = n^2 - n^(2-1)

so phi (n^2) = n^2 - n^1

= n(n-1)

= n phi(n)

Hope it answers the question.