# Show that a group of order $p^nm$ where $p>m$ is not simple.

Let $G$ a group of order $p^nm$, with $p$ a prime number, $p>m$ and $m, \ n \in \mathbb{N}$. Show that $G$ is a group is not simple.

-
I can has grammar? – Cameron Buie Oct 15 '12 at 23:17

2) How many Sylow $\,p-\,$subgroups can there be?
3) A Sylow $\,p-\,$subgroup is normal iff...?