Let p,q be distinct primes with q < p and let G be a finite group with |G| = pq.
(i) Use sylow's theorem to show that G has a normal subgroup K with
(ii) Use the Recogition Criterion to show for some homomorphism
(iii) Describle explicitly all homomorphisms . Hence describe all groups of order 35. How many such subgroups are there?
(iv) Describe explicitly all homomorphisms . Hence describe all groups of order 39. How many such groups are there, up to isomorphism?
any help is highly appreciated as usual. i will attempt the rest myself once i have good idea. thnx a lot.
for part (ii) i cant find any decent material to learn off and wikipedia doesnt seem to have much on the recognition theorem. any help on this is therefore appreciated aswell.
for part (iv)
ok so is:
so right? so now what would be the next step?
ok for this part this is what i got:
h is a group of order 39 = 13 x 3.
must divide 3. and . The only value satisfying these constraints is 1. So there is only 1 subgroup of order 13.
Similarly, must divide 13. and . The only value satisfying these constraints is 1 & 3. So there is only 2 subgroups of order 3.
Now since 13 and 3 are co prime, the intersection of these 3 subgroups is trivial and thus there is only 1 group of order 39 upto isomorphism...
is this done correct? please verify and correct if necessary?