Definition: A maximal subgroup is a proper subgroup $M$ of $G$ such that there are no subgroups $H$ of $G$ with $M \lt H \lt G$.
Theorem 1: Let $p$ be a prime and $P$ a $p$-group of order $p^a, a \geq 1$. Then
Proof: $(1)$ The order of the conjugacy classes of $P$ divide $p^\alpha$ so by the class equation, so must the order of $Z(G)$. So $\vert Z(G) \vert \neq 1$.
$(2)$ $H$ is normal so it is partitioned by conjugacy classes, in particular $\vert H \vert = \vert H \cap Z(P) \vert + \sum \vert C_i \vert$ for conjugacy classes $C_1, \dots, C_s$. $p$ divides $\vert H \vert$ and the sum of conjugacy class orders so it divides $\vert H \cap Z(P) \vert$, so $H \cap Z(P)$ can’t be trivial. If $\vert H \vert = p$ then $H \cap Z(P) = H$ so $H \leq Z(P)$.
$(3)$ TODO.
$(4)$ By induction. If $P$ abelian then trivial, so suppose otherwise. So $\vert P \vert \gt p$. Let $H \lt P$. $H \trianglelefteq Z(P)$ so if $H \not\leq Z(P)$ then $H \lt \langle Z(P), H \rangle \leq N_P(H)$, and we are done. So suppose $
Theorem 3: Let $G$ be a finite group, $p_1, \dots, p_s$ the distinct primes dividing its order and $P_i \in Syl_{p_i}(G), 1 \leq i \leq s$. Then the following are equivalent:
Proof:
$(1)$ U