Finding the order of a (mod m)

Here m > 1 and gcd(a,m)=1.

See MP313 lecture notes. This is a BCMATH conversion of a BC program.

Enter a:
Enter m ( > 1, gcd(a,m)=1):

Last modified 6th April 2004
Return to main page