The sum of the Euler functions proving that n equals all of its factors

When n is a prime number, it is easy to pass.

When n is composite, the n decomposition can be n=, followed by the n factor, that is, from the n decomposition of the thing to choose the quality factor and the power of the mass factor,

When M>1, so available, because are less than n, so you can use inductive method, proved to be established.

When M=1, it is also easy to pass.

Another way to prove it is from the basic of Information Security Mathematics (Chen).

The sum of the Euler functions proving that n equals all of its factors