Multiplicative order modulo n
For gcd(a,n)=1, the multiplicative order is the smallest positive k with a^k congruent to1 modulo n.
atlas-multiplicative-order-mod-n · canonical_mko
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
For gcd(a,n)=1, the multiplicative order is the smallest positive k with a^k congruent to1 modulo n.
atlas-multiplicative-order-mod-n · canonical_mko