- Thread starter
- Banned
- #1

(i) show that $x^m=y^m$ implies $x=y$

(ii)Hence show that for all g in G there is a unique x such that $x^m=g$

(i) there exist a, b such that am+bn=1 so that $m^{-1}=a (mod n)$.

Hence $x^m=y^m ->x=y$ ok?

(ii) (i) shows uniqueness. Not sure about existence. Cheers.