Homework Statement
Let gcd(h,k)=1, o(a)=h, o(b)=k, show that o(ab)=hk
Homework Equations
o(a)= order of a modulo n
o(a)=k iff k is smallest integer, a^k=1 mod n
The Attempt at a Solution
to prove o(ab) l hk, no problem, just need to show (ab)^{hk}=1 mod n
and to prove hk l o(ab), use...