Burnside's theorem
Burnside's theorem is a result in group theory that is often useful in taking account of symmetry when counting mathematical objects.
All 2 facts, and where they come from
Facts
2 facts · 0 confirmed by two sources · 0 cited · 2 from one source
Where this comes from
Papalocal keeps its own record. It started from these sources; what each one said is kept here as it was copied, so a change on their side never changes this page by itself. Tap one to read its version.
What Wikidata says · copied November 18, 2026 · revision 2473856164
- Described as
- a result in group theory that is often useful in taking account of symmetry when counting mathematical objects
- What it is
- theorem
- Named after
- William Burnside
- Wikipedias with a page
- 9
Wikidata item Q1996305 (wikidata.org/wiki/Q1996305), public domain (CC0). Copied 2026-11-18.
What Wikipedia says · copied November 18, 2026 · revision 1349836899
In mathematics, Burnside's theorem in group theory states that if G is a finite group of order paqb where p and q are prime numbers, and a and b are non-negative integers, then G is solvable. Hence each non-Abelian finite simple group has order divisible by at least three distinct primes.
From the Wikipedia article “Burnside's theorem” (en.wikipedia.org/wiki/Burnside's_theorem), by its contributors, under CC BY-SA 4.0 (creativecommons.org/licenses/by-sa/4.0/). Copied 2026-11-18; not changed.
Confirmed Two sources agree. Cited One source, and it names where it got it. One source One source, without a reference of its own. Sources disagree The sources disagree. We show the best-supported value and keep theirs below.
