Topper Copies

Let 'G' be a group which has no non-trivial subgroups. Then 'G' must be finite of prime order. Justify

Aryan Yadav, AIR 31, 2025

let G have infinite order : Chose any $a \in G$, $a \neq e$ (identity) $H = \langle a \rangle$ is a subgroup of G but $H \neq \{e\}$ as $a \neq e$ $\Rightarrow$ $H = G = \langle a \rangle$ — ①

Now $a^2 \in G$ & $a^2 \neq e$ (as order of a is $\infty$ from ①) $\Rightarrow$ $\langle a^2 \rangle$ is subgroup of G & $\Rightarrow$ $\langle a^2 \rangle = G$ but clearly $a \notin \langle a^2 \rangle$ We have contradiction Hence order of G must be finite

Let order of G be composite $\Rightarrow O(G) = nm$ $\Rightarrow \exists$ some prime $p > [?]$ such that $p \mid o(G)$ & $p \neq o(G)$ $\Rightarrow$ By Cauchy's theorem $\exists\ a \in G$ s/t $o(G) = p$ $\langle a \rangle$ is proper subgroup of $G$ as $o(a) = p$, $p \neq 1$, $o(G)$ $\Rightarrow$ We have contradiction $G$ must have prime order

Hence proved