Canonical: https://knowlpedia.com/algebra-groups/burnsides-pq-theorem/

# Burnside's p^a q^b Theorem

A finite group of order p^a q^b (two primes) is solvable

**Burnside's p^a q^b Theorem.**
Let \(G\) be a finite [group](https://knowlpedia.com/algebra-groups/group/) with
\[
|G| = p^{a}q^{b}
\]

for primes \(p,q\) and integers \(a,b \ge 0\). Then \(G\) is a [solvable group](https://knowlpedia.com/algebra-groups/solvable-group/).

## Remarks

This theorem is a landmark result: finiteness together with "at most two prime divisors" forces strong structural constraints. Standard proofs use tools from [representation theory](https://knowlpedia.com/algebra-representation-theory/), especially properties of [characters](https://knowlpedia.com/algebra-representation-theory/character/) of finite groups, to produce a nontrivial normal subgroup and then argue by induction on \(|G|\).
