Try j = lcm(o(x),o(y)).
Does anyone have any ideas on this one that could help get me started?
Here is about as far as I've come so far.
there are integers m, n such that x^m = e and y^n = e
x*y = y*x
we want to show:
there is an integer j where (x*y)^j = e
the question also wants me to show that that o(xy) divides o(x)*o(y). I'm thinking that the fact that i'm going to be able to show:
there is an integer a where j * a = m * n
is going to be helpful with the first question, but i haven't figured out how yet
We did use lcm in class once too.
I've tried to work with the least common multiple of the order of x and the order of y, but i can't see how that relates to x^m * y^m.
Thanks for your help so far
Unless and happen to commute, you can't slip x's past y's unless you know the multiplication table for the group.
You're welcome! Have a good one.
Everything else you've said makes sense
So (xy)^j ==> e and the order of x*y is lcm(o(x), o(y)), and thus finite.
Incidentally, on this forum, if you see a really cool bit of LaTeX code that you want to copy, double-click it, and the source code will pop up. Great time-saver!
Ah, ok. I see what you are saying about (xy) * (xy) * (xy), ...
I was just working at showing o(xy) divides o(x)*o(y) when i started thinking about just letting j = o(x) * o(y).
I don't think there is a need to use the least common multiple. The question doesn't ask for the order of (xy), only that it is finite.
It would certainly make the second part of the question easier if it were true that j = o(x) * o(y)
I wasn't able to get the LaTeX code to copy like you mentioned. Is that the mathematical text? I double click but nothing happens.
Either way works. The least common multiple is actually the order of xy, whereas the product o(x)*o(y) might not be (depending on whether o(x) and o(y) are relatively prime or not). Showing that o(xy) is finite is a bit easier than showing that o(xy) = lcm(o(x),o(y)).