Square-free implies solvability-forcing
From Groupprops
Template:Natural number property implication
Contents |
Statement
Suppose
where the pi are pairwise distinct prime numbers. In other words, n is a square-free number.
Then, n is a solvability-forcing number: any finite group of order n is a solvable group, i.e., a finite solvable group.
Facts used
Proof
The proof follows from facts (1) and (2), and the observation that in a group of square-free order, every nontrivial Sylow subgroup has prime order, and is hence cyclic.
References
Textbook references
- The Theory of Groups by Marshall Hall, Jr., Page 148, Corollary 9.4.1, More info
Facts about Square-free implies solvability-forcingRDF feed
| Fact about | Finite group +, Solvable group +, and Finite solvable group + |
| Page class | Fact + |
| Proved in | ? (?, ?, ?) + |
| Referenced in | ? (?, ?, ?) + |
| Stated in | ? (?, ?, ?) + |
| Uses | Every Sylow subgroup is cyclic implies metacyclic +, and Metacyclic implies solvable + |