Abstract.
A transitive permutation group of prime degree is doubly transitive or solvable. We give a direct proof of this theorem by Burnside which uses neither S-ring type arguments nor representation theory.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Author information
Authors and Affiliations
Corresponding author
Additional information
Received: 9 December 2004
Rights and permissions
About this article
Cite this article
Müller, P. Permutation groups of prime degree, a quick proof of Burnside’s theorem. Arch. Math. 85, 15–17 (2005). https://doi.org/10.1007/s00013-005-1421-z
Issue Date:
DOI: https://doi.org/10.1007/s00013-005-1421-z