proof that Euler function is multiplicative
Suppose that where are coprime. The Chinese remainder theorem
(http://planetmath.org/ChineseRemainderTheorem) states that if and only if and .
In other words, there is a bijective correspondence between these two sets:
- •
- •
Now the number of positive integers not greater than and coprime with is precisely , but it is also the number of pairs , where not greater than and coprime with , and not greater than and coprime with . Thus, .