Does anyone know how to prove that(adsbygoogle = window.adsbygoogle || []).push({});

[tex]\phi(mn) = \phi(m)\phi(n) \frac{d}{\phi(d)}[/tex]

where [tex]m, n \in \mathbb{N}[/tex] and [tex]d = \gcd({m, n})[/tex], without resorting to considering the prime factorizations of m and n? (It's perfectly doable that way, but not particularly elegant).

It can, supposedly, be done by noting that it holds for coprime m and n (a rather classical result), but I don't see how the rest follows... If m, n and d are as in the previous paragraph, then

[tex]\phi(\frac{mn}{d^2}) = \phi(\frac{m}{d}) \cdot \phi(\frac{n}{d})[/tex]

since m/d and n/d are coprime. At this point, one (at least I) feels like multiplying both sides by [tex]\phi(d^2)[/tex], but it doesn't do us much good since mn/d^2 and d^2 might not be coprime (take m = 4, n = 2). Any ideas?

**Physics Forums - The Fusion of Science and Community**

Dismiss Notice

Join Physics Forums Today!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# About Euler's totient function

Loading...

Similar Threads for Euler's totient function | Date |
---|---|

Euler Representation of complex numbers | Jan 8, 2016 |

Euler's identity, mathematical beauty and applications of it | Mar 15, 2015 |

Euler Totient Property Proof | Jun 28, 2012 |

Euler totient puzzle | Mar 16, 2012 |

Euler's Totient Function | Mar 5, 2012 |

**Physics Forums - The Fusion of Science and Community**