If m and n are coprime then there exist integers x and y such that
Can you see where to take this?
Let x and y be elements of a group G and m and n coprime positive integers. Show that if x^m = y^m and x^n = y^n then x=y
Let x and y be elements of a group G of orders m and n respectively. Show that if x and y commute and m and n are coprime, then order(xy) = mn
not sure at all on this
on the subject of groups.. could you please help me with another questipon.. about giving examples..
of a Group G and a proper subgroup H of G such that:
1) G is infinite and H is finite
2) G is infinite and non-abelian and H is abelian
3) G is infinite and abelian and H is infinite
4) G is infinite and H is not-abelian..
I'm really struggling..
for 1 could we have
G = the set of rotations about 0, H = the set of rotations of 90 degress for example?
and simililarly could we have that for 4?
I dunno if you can use trivial subgroups or not, but that makes some really easy.
Another one that isn't as cheap could be polynomials under addition of a finite field, like and just using H as the subgroup of polynomials with of degree 0 (the constant terms in the field).
2) invertible n by n matrices with entries from the reals under multiplication. If you want to be lame, let H be the identity matrix. Let H be the set matrices that have the same real number on the diagonal and 0s elsewhere. Note I_n is the identity matrix.
3)This one is pretty easy, tons of examples All of these groups are infinite and abelian and the containment is proper, take your pick.
4) You just need some infinite nonableian groups. would be a good start. Then like for subgroups upper triangular matrices might be a good one.
Well that is a start, you should try to think about some more on your own for sure, but this is the idea.