Suppose (a,n) = (b,n) = 1 and gcd (ord a, ord b) = 1.
Show ord(ab) = ord(a)*ord(b).
I think I just need a hint to carry this out. Thanks in advance.
since a and b are invertible mod n, then
Follow Math Help Forum on Facebook and Google+
View Tag Cloud