5. Show that ϕ(n^2) = nϕ(n) for all positive integers n. [Hint: Show it for n = 1 and also for n

Name: 5. Show that ϕ(n^2) = nϕ(n) for all positive integers n. [Hint: Show it for n = 1 and also for n = p^a, where p is prime.]
Uploaded: 2023-01-07T15:38:48-08:00
Duration: 3 min 52 s
Channel: Sri K
Description: 5. Show that ϕ(n^2) = nϕ(n) for all positive integers n. [Hint: Show it for n = 1 and also for n = p^a, where p is prime.]

Hello, let's have a look at the question. So here it is given for n is greater than equals to 2,

Question

5. Show that $\phi(n^2) = n\phi(n)$ for all positive integers $n$. [Hint: Show it for $n = 1$ and also for $n = p^a$, where $p$ is prime.]

          5. Show that $\phi(n^2) = n\phi(n)$ for all positive integers $n$. [Hint: Show it for $n = 1$ and also for $n = p^a$, where $p$ is prime.]

5. Show that ϕ(n^2) = nϕ(n) for all positive integers n. [Hint: Show it for n = 1 and also for n = p^a, where p is prime.]

Added by Victor A.

Elementary and Intermediate Algebra

Alan S. Tussy, R. David Gustafson 5th Edition

Thanks for your feedback!

5. Show that (n2) = no(n) for all positive integers n.[Hint: Show it for n = 1 and also for n = p", where p is prime.

Play audio

Feedback

Sri K and 59 other subject Algebra educators are ready to help you.

Ask a new question

Labs

Want to see this concept in action?

NEW

Explore this concept interactively to see how it behaves as you change inputs.

View Labs

Key Concepts

Question

5. Show that $\phi(n^2) = n\phi(n)$ for all positive integers $n$. [Hint: Show it for $n = 1$ and also for $n = p^a$, where $p$ is prime.]

Please give Ace some feedback