euler_totient_function_multiplicative
Provednumber-theoryproved
Euler's totient function is multiplicative: φ(mn) = φ(m)φ(n) for gcd(m,n)=1. Proved. Fundamental in number theory and cryptography.
Preamble
import Mathlib
Formal statement
import Mathlib
theorem euler_totient_function_multiplicative (m n : ℕ) (hcop : Nat.Coprime m n) :
Nat.totient (m * n) = Nat.totient m * Nat.totient n := by
sorrySource