Burnside's Theorem

From ProofWiki
Jump to: navigation, search

Theorem

Let $G$ be a finite group.

Let the order of $G$ be $p^m q^n$ where:

$p, q$ are prime
$m, n \in \N$


Then $G$ is solvable.


Proof


Source of Name

This entry was named for William Burnside.