Prove that no group of order \(2^m \cdot 5\) with \(m\geq 1\) is simple.
Solution.
Let \(G\) be a group of order \(2^m \cdot 5\) with \(m \leq 1\text{,}\) and suppose by way of contradiction that \(G\) is simple. By Sylow’s Theorems we know the following: - \(n_{5}|2^m\) and \(n_5\equiv1\mod{5}\text{,}\) and - \(n_{2}|5\) and \(n_{2}\equiv1\mod{2}\text{,}\) so our options are \(3\) and \(5\text{.}\) Suppose its \(3\text{.}\) Let \(G\) act on \(\Syl_2(P)\) by conjugation, yielding the permutation representation homomorphism \(\rho:G\to S_{3}\text{.}\) The kernel of this homomorphism cannot be trivial as the conjugation action on Sylow subgroups is transitive by Part (2) of Sylow’s Theorems. Notice \(|G|\) does not divide the order of \(S_{3}\text{,}\) so our kernel cannot be all of \(G\text{,}\) making \(\ker(\rho)\) a nontrivial normal subgroup of \(G\text{.}\)
If \(n_2=5\text{,}\) then \(G\) must divide \(5!\text{,}\) meaning that \(m=1\text{.}\) However, by the cyclic subgroup generated by an element of order \(5\) has index \(2\) in \(G\text{,}\) making it normal.
Thus \(G\) cannot be simple.