Burnside's Theorem

From ProofWiki
Jump to: navigation, search

Theorem

Every finite group of order $p^m q^n$ where $p, q$ are prime and $m, n \in \mathbb N$ is solvable.


Proof


Source of Name

This entry was named for William Burnside.