Proving Solvability of Group Order 12p

  • Thread starter Thread starter fireisland27
  • Start date Start date
  • Tags Tags
    Group
fireisland27
Messages
10
Reaction score
0

Homework Statement



Show that a group of order 12p is solvable for any prime p greater than 11

Homework Equations



I'm not very good about solvability questions so if anybody has any good ideas I'd be interested to hear them.

The Attempt at a Solution



I know that that every group of order 12 is either isomorphic to A4 or has an element of order 6, but I'm not really sure how to use this.
 
Physics news on Phys.org
Call the group in question G. You know that G has a subgroup H of order p.

If you can show that H is a normal subgroup of G, then you know that G is solvable if and only if H and G/H are solvable. It's considerably simpler to show that H and G/H are solvable (hint: H has prime order and G/H has order 12).
 
Thread 'Use greedy vertex coloring algorithm to prove the upper bound of χ'
Hi! I am struggling with the exercise I mentioned under "Homework statement". The exercise is about a specific "greedy vertex coloring algorithm". One definition (which matches what my book uses) can be found here: https://people.cs.uchicago.edu/~laci/HANDOUTS/greedycoloring.pdf Here is also a screenshot of the relevant parts of the linked PDF, i.e. the def. of the algorithm: Sadly I don't have much to show as far as a solution attempt goes, as I am stuck on how to proceed. I thought...
Back
Top