Composition Series and simple groups

lmn123
Messages
3
Reaction score
0

Homework Statement


For each m >= 2, find a group with a composition series of length 1 with a subgroup of length m.



Homework Equations


Simple groups iff length 1.

If G is abelian of order p1^k1...pr^kr, then length G = k1 + ... + kr

If G has a composition series and K is normal subgroup of G, then Length G = Length K + Length G/K



The Attempt at a Solution



I don't really see how this is even possible considering the fact that simple groups have length 1. So this means that G must be a simple group. I do not understand how to get a group of length m from a simple group.

I think I'm getting somewhere with this:

What I was thinking was have G = the cyclic group of order p. Then G would have length 1

Then I thought to Let H be a subgroup of G such that |G:H|=p^m, so if G=<a>, st |a|=p, then H=<a^p^(m+1)>

But this doesn't really work because the subgroup would have higher order than G right? Am I missing something, like modular arithmetic?

Any light you guys could shed would be appreciated
Thanks
 
Physics news on Phys.org
Fix m, and let G be an abelian group of length m. Can you put G inside a simple group? (What simple groups do you know?)
 
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...

Similar threads

Back
Top