Proving G is Solvable or Finding a Counter-Example

  • Thread starter Thread starter burritoloco
  • Start date Start date
burritoloco
Messages
81
Reaction score
0

Homework Statement


Suppose G has a solvable maximal normal subgroup. Either prove G is solvable, or give a counter-example.


Homework Equations





The Attempt at a Solution


We have that G/H is simple, not necessarily abelian, so my guess is there could be a counter-example. However, I'm not sure what it is.
I know the symmetric group S_5 is not solvable and it has the unique proper normal subgroup A_5, but A_5 is not solvable, so this doesn't work as a counter.
Moreover, the quaternion group, dihedral groups are solvable too. Any help please?
My exam is tomorrow... Thanks for the help!
 
Physics news on Phys.org
What if G is the direct product of a solvable group with something suitable? Can this give you a counterexample?
 
There are two things I don't understand about this problem. First, when finding the nth root of a number, there should in theory be n solutions. However, the formula produces n+1 roots. Here is how. The first root is simply ##\left(r\right)^{\left(\frac{1}{n}\right)}##. Then you multiply this first root by n additional expressions given by the formula, as you go through k=0,1,...n-1. So you end up with n+1 roots, which cannot be correct. Let me illustrate what I mean. For this...
Back
Top