[Math] Groups with $|G| = p^2q$. Prove that if $p$ and $q$ are primes, then there are no simple groups of order $p^2q$.

abstract-algebrafinite-groupsgroup-theory

Groups with $|G| = p^2q$.

Prove that if $p$ and $q$ are primes, then there are no simple groups of order $p^2q$.

Also another question, do p and q have to be distinct for this to hold?
On top of that, I know we have to use the Sylow Theorems but I do not understand them as they are currently.

Best Answer

First, suppose $p<q$. Then $n_q\equiv 1\pmod{q}$, and $n_q\mid p^2$. So the only possibilities are that $n_q=1,p,p^2$. If $n_q=1$, the group is not simple. But $n_q=p$ is impossible, else $q\mid p-1$. So $n_q=p^2$. Then we have $p^2$ groups of prime order $q$, so they have pairwise trivial intersection, and this forces the $p$-Sylow subgroup to be unique.

The $q$-Sylow subgroups give a total of $p^2(q-1)$ elements of order $q$. This accounts for all but $p^2$ elements of the group, so any $p$-Sylow subgroup must be these remaining elements, hence unique.

The case where $q<p$ is quite quick. Any $p$-Sylow subgroup has index $q$. This is smallest prime dividing $|G|$, so your $p$-sylow subgroup is normal.

Related Question