Blog Archive

Thursday, March 14, 2024

A nice Property of Euler function, prove via multi set.

We know that Euler function

(2)φ(n)=np|n((11p)

Proposition.

Let gcd(s,t)=g

(3)φ(g)φ(st)=gφ(s)φ(t)

Proof.

The left hand side is

(4)gstp|g(11p)p|st(11p)

and the right hand side is

(5)gstp|s(11p)p|t(11p)

So we only need to prove that

(6)ts↓=stgcd(s,t)

Which is extremely obvious. You doubt count the gcd part in the left hand side.

The notation is from coproduct, but if it is coproduct, we only can talk about isomorphism. So what I mean here is union of multi set.

 

No comments:

Post a Comment

Popular Posts