Burnside's Theorem
From ProofWiki
Theorem
Every finite group of order $p^m q^n$ where $p, q$ are prime and $m, n \in \mathbb N$ is solvable.
Proof
You can help Proof Wiki by expanding it.
To discuss it in more detail, feel free to use the talk page.
When this page/section has been completed, {{Stub}} should be removed from the code.
If you would welcome a second opinion as to whether your work is correct, add a call to {{Proofread}} the page (see the proofread template for usage).
Source of Name
This entry was named for William Burnside.
