Let $m,n \in \Bbb Z$. Show that $\gcd(m,n)$ is a generator for the subgroup $\langle m,n\rangle$.
The subgroup $\langle m,n\rangle$ must contain at least the elements $m,m^2,n,n^2, mn,nm,m^{-1}$ and $n^{-1}$. Let $\gcd(m,n)=d$. We know that $d \mid m$ and that $d \mid n$. These two imply that $d \mid m^2$ and that $d \mid n^2$. Also $d$ divides both $mn$ and $nm$.
What can I do to show that $\langle d \rangle =\{d^k \mid k \in \Bbb Z\} = \langle m,n\rangle$? It seems that I could use the fact that $\langle m,n\rangle$ is the $smallest$ subgroup that contains $\{m,n\}$ and since $d$ divides both elements they are some multiples of $d$?