Recommended
Defined mathematical notation
Browse 25 linked conservative definitions and 84 independently checked theorems without losing their exact first-order expansions.
Browse definitions and theorems →Coprime-residue counts · prime-power blocks · distinct-prime products · Constructive arithmetic
n>0 ⇒ ∃t. Phi(n,t) ∧ t=∏ over distinct p∣n of p^(vₚ(n)−1)(p−1)
Prove the equality between an actual count of coprime residues and an independently computed Euler product.
Current library: Alpha v34, 4,223 checked-use theorems; Stable remains 432. Historical first admissions, original proof editions, and non-admitted aliases are preserved. Exact original first-admission records.
Recommended
Browse 25 linked conservative definitions and 84 independently checked theorems without losing their exact first-order expansions.
Browse definitions and theorems →Exact certificate
Inspect all 3206 native tactic lines and 266 actual proof prerequisites with every definition fully expanded.
Open the exact edition →Focused route
Start at theorem TP0054 and follow only the lemmas and conservative definitions supporting totient_euler_product_formula.
TP0019 totient_exists_unique · TP003B totient_prime_power_value · TP003F totient_coprime_multiplicative · TP0052 totient_euler_product_one · TP0051 totient_euler_product_iff · TP0054 totient_euler_product_formula.4fcb3cd45e83448776abb9e33692496a7acfa98a051cae15761826a0b15fda44.