How to show every subgroup of a cyclic group is cyclic?
If the original group is generated by $a$, and $d$ is the least positive integer such that $a^d$ is in the subgroup, then show using the division algorithm that $a^d$ generates the subgroup.
To elaborate, the division algorithm says:
If $m$ and $n$ are integers and $n$ is positive, then there are unique integers $q$ and $r$ such that $m=nq+r$ and $0\leq r\lt n$.
You could prove this by taking $r$ to be the least nonnegative integer expressible in the form $m-np$ as $p$ ranges over the integers, which then determines $q$. (There are details here which I am omitting.)
Suppose $G$ is a cyclic group (finite or infinite) with generator $a$, i.e., $G=\langle a\rangle$. Let $H$ be a subgroup of $G$. Let $d$ be the smallest element of the set of positive integers $n$ such that $a^n$ is in $H$. (Unless $G$ is infinite and $H$ is trivial, this exists.) If $b$ is an arbitrary element of $H$, then because $b$ is in $G$, $b=a^m$ for some integer $m$. Apply the division algorithm to write $m=dq+r$ for integers $q$ and $r$ with $0\leq r\lt d$. Then $b=a^m=(a^d)^q\cdot a^r$. Since $b$ is in $H$ and $a^d$ is in $H$, it follows that $a^r=a^m\cdot(a^d)^{-q}$ is in $H$. If $r$ were positive, this would contradict the choice of $d$, so $r=0$, and $b=a^m=(a^d)^q$. Since $b$ was arbitrary, this shows that $H\subseteq \langle a^d\rangle$.
It is enough to show that every maximal proper subgroup $H$ of $G$ is cyclic, by induction; to start the induction, notice that if $G$ is simple, then there is nothing to prove.
So let $H\subset G$ be a maximal proper subgroup, so that $G/H$ is simple. There exists then a prime $p$ such that $G/H$ is isomorphic to $\mathbb Z/p\mathbb Z$ and then $pG\subset H$. From the exact sequence of abelian groups $$0\to H\to G\to G/H\to 0$$ we get the exact sequence $$0\to H/pG\to G/pG\to G/H\to 0.$$ Now this is an exact sequence of $\mathbb F_p$-vector spaces in an obvious way, and $G/H$ and $G/pG$ are vector spaces of dimension $1$ (for the first, this is obvious; for the second, it is enough to notice that $G/pG$ is cyclic as an abelian group and non-zero because it surjects onto $G/H$) It follows that $H/pG=0$, i.e., that $H=pG$. Since $G$ is cyclic, then $H$ is cyclic too.
If you accept Lagrange's theorem and the existence of quotient groups, there's another argument in the finite case. Let $G=\langle a\rangle$ be a cyclic group of order $n$. By Lagrange's theorem if $H$ is a subgroup of $G$ then $m=|H|$ is a factor of $n$, and if $m\mid n$ then $H_m=\langle a^{n/m}\rangle$ is a subgroup of order $m$. I claim $G$ has no other order $m$ subgroup. The group $G/H$ has order $n/m$ so $x^{n/m}=e$ for all $x\in G/H$. This translates to $x^{n/m}\in H$ for all $x\in G$ which means $H_m\le H$. These have the same order so $H=H_m$.