Euler's theorem in number theory
For n≥2 and gcd(a,n)=1, a^phi(n) is congruent to1 modulo n.
atlas-euler-theorem-number-theory · canonical_mko
Euler's theorem in number theory
This English edition is an AI candidate and does not yet have an OCME Atlas (GPT-6) Twin closure receipt.
Catalogue presentation and source-binding data