Let $G$ be a finite group of order $n$ and let $m$ be an integer that is relatively prime to $n=|G|$. Show that for any $a\in G$, there exists a unique element $b\in G$ such that
\[b^m=a.\]
Add to solve later

Since $m$ and $n$ are relatively prime integers, there exists integers $s, t$ such that
\[sm+tn=1.\]

Then we have
\begin{align*}
a&=a^1=a^{sm+tn}=a^{sm}a^{tn} \tag{*}
\end{align*}
Note that since the order of the group $G$ is $n$, any element of $G$ raised by the power of $n$ is the identity element $e$ of $G$.
Thus we have
\[a^{tn}=(a^n)^t=e^t=e.\]
Putting $b:=a^s$, we have from (*) that
\[a=b^me=b^m.\]

Now we show the uniqueness of such $b$. Suppose there is another $g’\in G$ such that
\[a=b’^m.\]
Then we have
\begin{align*}
&\quad b^m=a=b’^m\\
&\Rightarrow b^{sm}=b’^{sm} \quad \text{ by taking $s$-th power}\\
&\Rightarrow b^{1-tn}=b’^{1-tn}\\
&\Rightarrow b(b^n)^t=b'(b’^n)^t\\
&\Rightarrow b=b’ \quad \text{ since } b^n=e=b’^n.
\end{align*}
Therefore, we have $b=b’$ and the element $b$ satisfying $a=b^m$ is unique.

Proof 2.

Consider a map $f$ from $G$ to $G$ itself defined by sending $g$ to $f(g)=g^m$.
We show that this map is injective.
Suppose that $f(g)=f(g’)$.

Since $m$ and $n$ are relatively prime integers, there exists integers $s, t$ such that
\[sm+tn=1.\]

We have
\begin{align*}
f(g)&=f(g’)\\
&\Rightarrow g^m=g’^m \\
&\Rightarrow g^{sm}=g’^{sm} \quad \text{ by taking $s$-th power}\\
&\Rightarrow g^{1-tn}=g’^{1-tn}\\
&\Rightarrow g(g^n)^t=g'(g’^n)^t\\
&\Rightarrow g=g’ \quad \text{ since } g^n=e=g’^n, n=|G|.
\end{align*}

Therefore the map $f$ is injective. Since $G$ is a finite set, it also follows that the map is bijective.
Thus for any $a \in G$, there is a unique $b \in G$ such that $f(b)=a$, namely, $b^m=a$.

If Two Subsets $A, B$ of a Finite Group $G$ are Large Enough, then $G=AB$
Let $G$ be a finite group and let $A, B$ be subsets of $G$ satisfying
\[|A|+|B| > |G|.\]
Here $|X|$ denotes the cardinality (the number of elements) of the set $X$.
Then prove that $G=AB$, where
\[AB=\{ab \mid a\in A, b\in B\}.\]
Proof.
Since $A, B$ […]

If a Group is of Odd Order, then Any Nonidentity Element is Not Conjugate to its Inverse
Let $G$ be a finite group of odd order. Assume that $x \in G$ is not the identity element.
Show that $x$ is not conjugate to $x^{-1}$.
Proof.
Assume the contrary, that is, assume that there exists $g \in G$ such that $gx^{-1}g^{-1}=x$.
Then we have
\[xg=gx^{-1}. […]

Are Groups of Order 100, 200 Simple?
Determine whether a group $G$ of the following order is simple or not.
(a) $|G|=100$.
(b) $|G|=200$.
Hint.
Use Sylow's theorem and determine the number of $5$-Sylow subgroup of the group $G$.
Check out the post Sylow’s Theorem (summary) for a review of Sylow's […]

A Group with a Prime Power Order Elements Has Order a Power of the Prime.
Let $p$ be a prime number. Suppose that the order of each element of a finite group $G$ is a power of $p$. Then prove that $G$ is a $p$-group. Namely, the order of $G$ is a power of $p$.
Hint.
You may use Sylow's theorem.
For a review of Sylow's theorem, please check out […]

If Every Nonidentity Element of a Group has Order 2, then it’s an Abelian Group
Let $G$ be a group. Suppose that the order of nonidentity element of $G$ is $2$.
Then show that $G$ is an abelian group.
Proof.
Let $x$ and $y$ be elements of $G$. Then we have
\[1=(xy)^2=(xy)(xy).\]
Multiplying the equality by $yx$ from the right, we […]

Abelian Groups and Surjective Group Homomorphism
Let $G, G'$ be groups. Suppose that we have a surjective group homomorphism $f:G\to G'$.
Show that if $G$ is an abelian group, then so is $G'$.
Definitions.
Recall the relevant definitions.
A group homomorphism $f:G\to G'$ is a map from $G$ to $G'$ […]

A Group Homomorphism is Injective if and only if Monic
Let $f:G\to G'$ be a group homomorphism. We say that $f$ is monic whenever we have $fg_1=fg_2$, where $g_1:K\to G$ and $g_2:K \to G$ are group homomorphisms for some group $K$, we have $g_1=g_2$.
Then prove that a group homomorphism $f: G \to G'$ is injective if and only if it is […]