Proof of the Multiplicative Property of Totient Functions
📂Number TheoryProof of the Multiplicative Property of Totient Functions
Theorem
gcd(n,m)=1⟹ϕ(nm)=ϕ(n)ϕ(m)
Description
It is an essential property to obtain various important results derived from the torsion function. There’s definitely a condition called gcd(n,m)=1, so don’t be mistaken for it being almighty.
Proof
Without loss of generality,
nm=p1k1p2k2⋯prkrp1<p2<⋯<pr
Let’s assume. Since gcd(n,m)=1 from the assumption, it must be either pi∣n or pi∣m.
- Primes satisfying pi∣n are denoted as N1,N2,⋯,Nr1
- Primes satisfying pi∣m are denoted as M1,M2,⋯,Mr2
Then, it can be expressed as
n=N1a1N2a2⋯Nr1ar1m=M1b1M2b2⋯Mr2br2
and
ϕ(nm)===nmp∣nm∏(1−p1)p1k1p2k2⋯prkrp∣nm∏(1−p1)N1a1N2a2⋯Nr1ar1M1b1M2b2⋯Mr2br2p∣nm∏(1−p1)
Again, since from the assumption gcd(n,m)=1, it must be either p∣n or p∣m, therefore
ϕ(nm)===N1a1N2a2⋯Nr1ar1M1b1M2b2⋯Mr2br2p∣n∏(1−p1)p∣m∏(1−p1)N1a1N2a2⋯Nr1ar1p∣n∏(1−p1)M1b1M2b2⋯Mr2br2p∣m∏(1−p1)ϕ(n)ϕ(m)
■