# There are no simple groups of order $2^n.5$ for $n\geq 4$.

How do you show that there are no simple groups of order $2^n\times 5$ for $n\geq 4$, without using the theorem that a finite group of order $p^nq^m$, where p, q are primes and $m,n\geq 1$ is not simple.

I have a hint to 'use the coset action determined by the Sylow 2-subgroup', but I'm not sure what this means.

-
If this is homework please tag this with the homework tag –  Belgi May 17 '12 at 11:29
It's not homework, I'm just going through some questions that don't come with solutions. –  09867 May 17 '12 at 11:30

Hint: There are either 5 or 1 Sylow 2-subgroups (why?). Assuming there are 5 and we let $G$ act by conjugation on the Sylow 2-subgroups we get a non-trivial homomorphism from $G$ to $S_5$. What can we say about its kernel?
@09867 What's the order of G and what's the order of $S_5$. –  JSchlather May 17 '12 at 12:20
$|S_5|=120$, $|G|=2^n.5$. So if $n\geq 4$ $|G|\geq 80$. So.. this homomorphism can't exist because 80 doesn't divide 120? –  09867 May 17 '12 at 12:25