No simple group of order 2016 The year 2016 is coming up, so it makes me wonder: how do you prove that there is no simple group of order 2016? (without invoking the 10,000 page theorem on the classification of simple groups)
 A: Let $|G| = 2016 = 2^{5}\cdot 3^{2} \cdot 7$.
By Sylow theorems let $n_{7}$ be the number of Sylow $7$-subgroups. 
Then by Sylow theorems, if $n_{7} \neq 1$.
We proceed through cases:
Case 1: Suppose $n_{7} = 8$.
We have $[G: N_{G}(P)] = n_{7} = 8$, where $P$ is a sylow $7$-subgroup.
Then $\left|N_{G}(P)\right| = 4\cdot 9 \cdot 7$.
Now, let $G$ act on the set of left cosets of $N_{G}(P)$, then this action affords a homomorphism: $\phi: G \rightarrow S_{8}$.
Now, suppose $G$ is simple, then $\phi$ is injection into $S_{8}$. If $G$ has a subgroup of index $2$, then it would not be simple and so $G$ is a subgroup of $S_{8}$ which does not have a subgroup of index $2$ it follows from the Second Isomorphism Theorem that $G$ must be in $A_{8}$. 
Fact 1: if $P$ is a Sylow $7$-subgroup in $S_{8}$, then $\left|N_{A_{8}}(P)\right| = \frac{1}{2}\left|N_{S_{8}}(P) \right|$. 
Fact 2: $\left|N_{S_{p +1}}(P) \right| = p(p-1)$, it follows that $|N_{S_{8}}(P)| = 6 \cdot 7$. 
It follows from Fact 1 that $\left|N_{A_{8}}(P) \right| = 21$. But $N_{G}(P) \leq N_{A_{8}}(P)$ and so we should have $\left |N_{G}(P) \right|$ dividing $21$, which is absurd and so $G$ must not be simple. 
A: I just stumbled on this question, so I thought I'd "close the loop", and take care of the one case not yet handled in the other answer or the comments: when $n_7$ is $36$.
Let $P=\langle g\rangle$ be a Sylow 7-group, and suppose $G$ is a simple group with $36$ Sylow 7-subgroups.  Then $|N_G(P)|=56$ and by the normalizer-centralizer theorem, $|C_G(P)|=28$.
If $z\in C_G(P)$ is an involution (has order $2$), then $gz$ has order $14$. If we look at the permutation representation $\rho:G\rightarrow A_{36}$, induced by conjugation of the Sylow 7-subgroups, then we must have (up to conjugation)
$$ \rho(gz) = (1,2,3,4,5,6,7)(8,9,\cdots,21)(22,23,\cdots,35) $$
This is because we need $\rho(gz)$ to be an even permutation, and we need its square $\rho(g)$ to fix exactly one point [the one corresponding to $P$].
Thus $\rho(z)=\rho(gz)^7$ has $8$ fixed points, and thus $z$ normalizes $8$ Sylow 7-subgroups.  Note that an element $h\in N_G(P)\setminus C_G(P)$ could only fix at most $6$ points, since if it fixed two points in one orbit of $\rho(g)$ then $\rho([h,g])\in\rho(P)$ would fix more than one point, and we would then have $[h,g]=1$, so $h\in C_G(P)$.
So we really have $z$ centralizes $8$ Sylow 7-subgroups.  Consider then $C_G(z)$. It contains $C_G(P)$, and we must have $[C_G(z):C_G(P)]$ divisible by $8$, since $C_G(P)$ will normalize $P$ in $C_G(z)$, and there are $8$ Sylow 7-subgroups in $C_G(z)$. Thus $[G:C_G(z)]$ divides $9$, and by simplicity of $G$ we get that $[G:C_G(z)]=9$.
Now $\sigma:G\rightarrow A_9$ is then a permutation representation, given by conjugation of $z$.  Since $\sigma(g)$ is then a 7-cycle, we see that $g$ centralizes exactly $2$ conjugates of $z$, say $z$ and $z^x$. But since being conjugate is an equivalence relation and $z$ was an arbitrary involution in $C_G(P)$, we see that the involutions of $C_G(P)$ can be grouped in pairs. This is the contradiction, since an even-order group always has an odd number of involutions.
