Let n be a positive integer having k distinct odd prime divisors. Prove that 2^k divides Euler phi-function(n).
Follow Math Help Forum on Facebook and Google+
Suppose where . Then . Note that . So we have .
View Tag Cloud