Prove that if $ \gcd(a,m) = 1 $ and $ a b \equiv a c ~ (\operatorname{mod} ~ m) $, then $ b \equiv c ~ (\operatorname{mod} ~ m) $.
To prove that if $ab\equiv ac\bmod n$ and $(a,n)=1$ then $b\equiv c\bmod n$