This problem is from an an Introduction to Abstract Algebra by Derek John that I am solving.
I am trying to prove that any group of order 1960 aren't simple, so I am doing it by contradiction, but I got stuck in the middle.
Suppose that $|G| = 1960 = 2^3 * 5 * 7^2$, by Sylow theory we have 2,5,7 subgroup of G. After some computations I got the following least values for $n_p$. The following are the values $n_2 = 5$, $n_7 = 8$, and $n_5 = 56$, but I don't know how to proceed further.
If the group is not simple, then there actually must be $8$ Sylow-$7$ subgroups. It's the only option give the Sylow theorems.
So $G$ permutes these $8$ subgroups through conjugation. That means there is a map from $G$ to $S_8$. The kernel of this map is a normal subgroup, so the kernel is either all of $G$ or is trivial. The map itself is nontrivial since Sylow-7 subgroups can be permuted to one another. This means the kernel cannot be all of $G$. On the other hand, $7^2$ does not divide $8!$, so the kernel cannot be trivial. So there actually cannot be $8$ Sylow-$7$ subgroups. There must only be $1$, precluding $G$ from being simple.