There is already another proof of this theorem, but I'm curious about solving this problem as written in Dummit&Foote(Ex.6.2 12)
Show there is no simple group $G$ with $|G|=9555$.
No simple groups of order 9555: proof
Hint: Let $Q \in Syl_{13}(G)$ and let $P\in Syl_7(N_G(Q))$. Argue that $Q \unlhd N_G(P)$. Why is this a contradiction?
It is quite similar to previous solution, but there are diffrences:
(1) They chose Sylow 7-subgroup as Q.
(2) No normality as $Q \unlhd N_G(P)$ does not require. Contradiction from Lagranges theorem.
(3) Unlikely another proof, in hint, $P$ is not 7-subgroup of $G$.
I'm in this progress: First $9555=3 \times 5 \times 7^2 \times 13$.
$n_{13}=105$ is uniquely determined, so $|N_G(Q)|=7\times 13$. Also from $P\leq N_G(Q)$, we can think $PQ$ is a subgroup of $G$.
Since $|P|=7$ and $|Q|=13$, $PQ$ is abelian so we can conclude $Q\leq N_G(P)$.
However, I'm facing in those problems:
(1) Strengthening $Q\leq N_G(P)$ to $Q \unlhd N_G(P)$
(2) Explaining why $Q \unlhd N_G(P)$ gives contradiction?
For above (2), I'm guessing $N_G(P)=G$ so it contradicts to simplicity.
I solved with some uncertainty. Please verify it.
(1) Consider order of $N_G(P)$. By Lagrange's theorem, $|P|,|Q|$ divides $N_G(P)$. But Sylow's divisabilty condition gives $Q \unlhd N_G(P)$ in any case of order < $3 \times 5 \times 7^2 \times 13$ except $3 \times 5 \times 7 \times 13$. But latter case can deduce normality by element counting.
(2) $Q \unlhd N_G(P)$ gives $N_G(P) \cap N_G(Q)=N_{N_G(P)}(Q)=N_G(P)$ So $N_G(P) \subseteq N_G(Q)$. But order of normalizer of Sylow 7-subgroup of $G$ is already $7^2\times 13$ and $|N_G(P)|$ will be equal or greater. Contradiction by inclusion and order comparison.