1

Suppose $G$ is an abelian group (not necessarily finite) and $a,b$ are two elements in $G$ such that $o(a) = m$ and $o(b) = n.$

I need to show that $\text{lcm}(m,n)/\gcd(m,n)$ divides $o(ab)$

Please note that $m$ and $n$ are not relatively prime.

I have tried looking at $m$ and $n$ as expansions of powers of primes and have recognized that $\text{lcm}(m,n) / \gcd (m,n) =A$ where $A$ is always an integer.

I have tried to show that $o(ab)/A$ is an integer but have gotten stuck and don't know what else to try.

miracle173
  • 11,049

1 Answers1

1

Since $G$ is abelian, $(ab)^{mn}=a^{mn} b^{mn}=(a^m)^n (b^n)^m=1$. Thus $o(ab)| mn$. So $mn=o(ab)s_1$, for some $s \in \Bbb{Z}$. On the other hand $A:=lcm(m,n)/gcd(m,n)=mn/gcd(m,n)^2$. Hence we have $o(ab)=\frac{mn}{s_1}=\frac{A (gcd(m,n))^2}{s_1} $. Put $s_2=\frac{gcd(m,n))^2}{s_1}$. So $o(ab)=As_2$, i.e. $A|o(ab)$, as desierd.

Rima
  • 251