proof that Euler function is multiplicative
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, .
|Title||proof that Euler function is multiplicative|
|Date of creation||2013-03-22 15:03:40|
|Last modified on||2013-03-22 15:03:40|
|Last modified by||Wkbj79 (1863)|