# Burnside's Theorem

Jump to navigation
Jump to 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

This theorem requires a proof.You can help $\mathsf{Pr} \infty \mathsf{fWiki}$ by crafting such a proof.To discuss this page in more detail, feel free to use the talk page.When this work has been completed, you may remove this instance of `{{ProofWanted}}` from the code.If you would welcome a second opinion as to whether your work is correct, add a call to `{{Proofread}}` the page. |

## Source of Name

This entry was named for William Burnside.

There are no source works cited for this page.In particular: Sources for this theorem/proof would be highly desirableSource citations are highly desirable, and mandatory for all definition pages.Definition pages whose content is wholly or partly unsourced are in danger of having such content deleted. To discuss this page in more detail, feel free to use the talk page. |