This particular question was asked in my algebra quiz and I was unable to think of what result I should use to prove this statement.
Let $G$ be a finite abelian group and $a,b \in G$ with $|a|=m$ and $|b|=n$. Then prove that there always exists an element of $G$ whose order $= \text{lcm}(m,n)$
I proved that there always exists an element whose order divides $\text{lcm} (m,n)$. If $\gcd (m,n) = 1$ then $|ab|=\text{lcm}(m,n)$ .But how to prove it in case when $\gcd(m,n)>1$?
Which result should I use?