Recommended
Defined mathematical notation
Browse 23 linked conservative definitions and 32 independently checked theorems without losing their exact first-order expansions.
Browse definitions and theorems →Actual unit permutations · independently counted totients · Constructive arithmetic
m>1 ∧ Unit(a,m) ∧ Phi(m,t) ⇒ ∃w. Pow(a,t,w) ∧ ModEq(m,w,1)
Follow the constructed multiplier permutation, the weighted finite product, and the count-prefix induction to an actual power congruent to one.
Current library: Alpha v34, 4,223 checked-use theorems; Stable remains 432. Historical first admissions, original proof editions, and non-admitted aliases are preserved.
Recommended
Browse 23 linked conservative definitions and 32 independently checked theorems without losing their exact first-order expansions.
Browse definitions and theorems →Exact certificate
Inspect all 1203 native tactic lines and 91 actual proof prerequisites with every definition fully expanded.
Open the exact edition →Focused route
Start at theorem EU0022 and follow only the lemmas and conservative definitions supporting euler_theorem_for_units.
EU000D euler_multiplier_permutation_exists · EU0017 euler_unit_product_coprime · EU001E euler_unit_count_product_balance · EU0020 euler_coprime_totient_power · EU0022 euler_theorem_for_units.1edfcb7021a0869c2493383c75dea367d757be0b77f36fc6ad3f5fd18ed38210.