Groupprops, The Group Properties Wiki (pre-alpha)

YOUR FEEDBACK IS IMPORTANT!

Please take a short user satisfaction survey about Groupprops.

Your survey responses will be helpful in improving the site experience!

Thanks in advance!

Square-free implies solvability-forcing

From Groupprops

Jump to: navigation, search

Template:Natural number property implication

Contents

Statement

Suppose n = p_1p_2 \dots p_r 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

  1. Every Sylow subgroup is cyclic implies metacyclic
  2. Metacyclic implies solvable

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

Personal tools