Definitions from Wikipedia (Burnside's theorem)
▸ noun: In mathematics, Burnside's theorem in group theory states that if G is a finite group of order where p and q are prime numbers, and a and b are non-negative integers, then G is solvable.
▸ Words similar to burnside's theorem
▸ Usage examples for burnside's theorem
▸ Idioms related to burnside's theorem
▸ Wikipedia articles (New!)
▸ Words that often appear near burnside's theorem
▸ Rhymes of burnside's theorem
▸ Invented words related to burnside's theorem
▸ noun: In mathematics, Burnside's theorem in group theory states that if G is a finite group of order where p and q are prime numbers, and a and b are non-negative integers, then G is solvable.
▸ Words similar to burnside's theorem
▸ Usage examples for burnside's theorem
▸ Idioms related to burnside's theorem
▸ Wikipedia articles (New!)
▸ Words that often appear near burnside's theorem
▸ Rhymes of burnside's theorem
▸ Invented words related to burnside's theorem