Topper Copies

$G$ is a finite abelian group. Order of $G = q$ (where $p$ is prime). To show $\exists\, b\in G$ such that $o(b)=p$.

Ritika Verma, AIR 25, 2023

Sol

$O(G)=q=pa$ (as divisible by prime $p$, $a\in I$)

$O(G)=pa$

Let $\exists$ no $b\in G$ s.t. $o(b)=p$

i.e. $\forall\, b\in G$, $o(b)\neq p$

but $o(b)\,|\,o(G) \Rightarrow o(b)\,|\,pa$

$\therefore o(b)\neq p \Rightarrow o(b)=a$ or any divisor of $a$

Let $c\in G$ s.t. $o(c)=a$ $\rightarrow$

$\Rightarrow \exists\ c^a$ element s.t. $c^a=d\in G$

$\Rightarrow (d)^p=(c^a)^p=c^{ap}=e$ (as $o(G)=ap$)

$\Rightarrow o(d)=p$ (as least element power $p$=prime.)

$\Rightarrow$ Contradiction, $\Rightarrow \exists\, b\in G$ such that $o(b)=p$

Pf: If $b \in G$, then $o(b) \mid o(G)$

Let $o(G) = n$

Let $o(b) = m$

$\Rightarrow b^m = e$

$\Rightarrow b^n$ [?] now $n \geq m$

$\Rightarrow$ let $n = mq + r$, $r < n$

$\Rightarrow b^n = b^{(mq+r)} = (b^m)^q \cdot b^r$

$b^n = b^r$

we know that $b^{o(G)} = e$ if $b \in G$

$\Rightarrow$ but $n$ is least number such that $b^n = 0$

$\Rightarrow r = 0$

$\Rightarrow n = mq$

$\therefore m \mid n \Rightarrow o(b) \mid o(G)$