Multiplicative order
In number theory, given an integer a and a positive integer n with gcd = 1, the multiplicative order of a modulo n is the smallest positive integer k withThe order of a modulo n is usually written ordn, or On.- Example :To determine the multiplicative order of 4 modulo 7, we compute 42 = 16 ≡ 2 and 43 = 64 ≡ 1 In number theory, given an integer a and a positive integer n with gcd(a,n) = 1, the multiplicative order of a modulo n is the smallest positive integer k withThe order of a modulo n is usually written ordn(a), or On(a).- Example :To determine the multiplicative order of 4 modulo 7, we compute 42 = 16 ≡ 2 (mod 7) and 43 = 64 ≡ 1 In number theory, given an integer a and a positive integer n with gcd(a,n) = 1, the multiplicative order of a modulo n is the smallest positive integer k withThe order of a modulo n is usually written ordn(a), or On(a).- Example :To determine the multiplicative order of 4 modulo 7, we compute 42 = 16 ≡ 2 (mod 7) and 43 = 64 ≡ 1 (mod