Gauss's totient sum identity
ProvedFamousTheorems.gauss_totient_sumGauss's totient sum identity. For every natural number ,
where is Euler's totient function.
The identity comes from sorting the fractions , , by their reduced denominators. It is used to show that the multiplicative group of a finite field is cyclic, and by Möbius inversion it yields the formula .
Formalization note. Mathlib's Nat.sum_totient. n.divisors is the finset of positive divisors of ; for it is empty and both sides are .
Preamble
import Mathlib
Formal statement
namespace FamousTheorems theorem gauss_totient_sum (n : ℕ) : ∑ d ∈ n.divisors, Nat.totient d = n := by sorry end FamousTheorems
Source
Listed in Mathlib's curated theorem manifests (docs/1000.yaml); formalized in Mathlib as `Nat.sum_totient`. Proof here reduces to that Mathlib result.