0

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?

ArsenBerk
  • 13,388
  • Hint: if $g=\gcd(m,n)$, consider the orders of $a^g$ and $b^g$, use the fact you've already established to find the order of $a^gb^g$, and then draw conclusions about the order of $ab$. – Greg Martin Nov 18 '20 at 07:49
  • https://math.stackexchange.com/questions/3737548/let-g-be-an-abelian-group-with-elements-x-y-of-orders-m-and-n-respectiv?rq=1 –  Sep 20 '21 at 12:02

0 Answers0