Main menu

Order of integer modn

Let n is a natural number greater than 1 and a is an integer such that gcd(a,n)=1.

The order of a modulo n is the smallest positive integer k such that a^k≡1(mod n)

Calculator