Show that every Abelian group of order 35 is cyclic.
Aakash Om Trivedi, AIR 73, 2025
Let, G be abelian group of order 35.
Therefore, by Cauchy theorem on abelian group for every prime divisor of order of group we can find an element of that order.
$\therefore$ As $5|35$ and $7|35$
By Cauchy,
$\exists\ a$ such that $a^5 = e$
and
Similarly
$\exists\ b$ such that $b^7 = e$
Now, to show that group (G) is cyclic, we need to find element in group of order 35 which will be generator
Now, By closure,
$ab \in G$ [$\because a \in G, b \in G$]
Now calculating,
$(ab)^{35}$.
first we will showing that in abelian group $(ab)^n = a^n b^n$
[Proof] By Induction
If $n=1$, this is trivial,
assume, true of $n=k$ $(ab)^k = a^k b^k$
Now for $n=k+1$
$(ab)^{k+1} = (ab)^k (ab)$
$= a^k b^k a b$
$= a^k . b^{k-1} (b a) . b$
$= a^k \cdot b^{k-1}(ab)b$ $\therefore (ab = ba)$
similarly continuity
$= a^{k+1} b^{k+1}$
$\therefore$ By induction theorem, $(ab)^n = a^n b^n$ for all n.
$\therefore (ab)^{35} = a^{35} b^{35}$
Now as $a^5 = e$, $b^7 = e$,
$\therefore = (a^5)^7 \cdot (b^7)^5$
$= e^7 \cdot e^5$
$= e$
$\therefore o(ab) \mid 35$
Now, by lagrange,
$o(ab) \mid o(G)$ $\therefore o(ab)$ can be 1, 7, 5, 35 as $o(G) = 35$
If possible
Now, if $o(ab) = 7$,
$(ab)^7 = a^7 \cdot b^7 = a^2 \cdot e$
$\neq e$ ($\because$ order of a is 5)
$\therefore a^m \neq e$ of $m < 5$
$\therefore$ order is not 7
Now, if possible
$o(ab) = 5$
$(ab)^5 = a^5 \cdot b^5 =$ [?] $\cdot b^5$
$\neq e$ ($\because$ order of b is 7)
$\therefore b^m \neq e$, $b < 7$
Now, if possible
$o(ab) = 1$
$ab = e \Rightarrow a^5 b^5 = e^5$
$\therefore a^5 b^5 = e$
Now $a^5 = e$
$\therefore b^5 = e$ which is not possible as order of b is 7
$\therefore o(ab) = 35$
$\therefore$ It is generator of [?]
$\therefore$ G is cyclic which is every abelian group of order 35.