Cyclic groups

  • Thread starter hsong9
  • Start date
  • #1
80
1

Homework Statement


Let G and H be cyclic groups, with |G| = m and |H| = n. If gcd(m,n) =1, show that G x H is cyclic.


The Attempt at a Solution


Let a = (g,h) in G x H. Then |a| = lcm (|g|,|h|).
Since gcd(m,n)=1, then lcm (m,n) = mn.
Thus lcm (|g|,|h|) = lcm (m,n) = mn.
so <a> = G x H has mn elements and a cyclic group.
Right?
 

Answers and Replies

  • #2
Dick
Science Advisor
Homework Helper
26,263
619
Basically ok. But you want to be a little more careful with your choice of g and h. It's not true that for every element g in G that |g|=|G|. E.g. |e|=1. And G could have nontrivial subgroups. You'd better make sure that g and h are generators.
 
  • #3
80
1
so.. you mean I have to make sense that for every element g in G that |g|=|G|?
If so..
Actually, the problem has Hint that [ G=<g> and H = <h>, show |(g,h)| = mn].
If consider this hint, my answer is ok?
or any other thing needs to prove?
 
Last edited:
  • #4
Dick
Science Advisor
Homework Helper
26,263
619
The point is that at least one g in G satisfies |g|=|G|. Otherwise, would it be a cyclic group? That's what the proof is missing.
 

Related Threads on Cyclic groups

  • Last Post
Replies
1
Views
1K
  • Last Post
Replies
9
Views
6K
  • Last Post
Replies
4
Views
2K
  • Last Post
Replies
3
Views
2K
  • Last Post
Replies
3
Views
2K
  • Last Post
Replies
3
Views
3K
  • Last Post
Replies
3
Views
1K
  • Last Post
Replies
1
Views
2K
  • Last Post
Replies
6
Views
2K
  • Last Post
Replies
2
Views
5K
Top