Suppose that every prime dividing n also divides m. Prove that φ(mn) = nφ(m).
Follow Math Help Forum on Facebook and Google+
Originally Posted by NikoBellic Suppose that every prime dividing n also divides m. Prove that φ(mn) = nφ(m). This follows at once from the formula: if , primes. But you can also do a counting argument. Tonio
View Tag Cloud