Sylow Theorems Explained with Worked Examples

If with , then has subgroups of order (Sylow -subgroups), and their number satisfies and .

Write 2x or 2*x to multiply, ^ for powers, and ; between simultaneous equations. You can also type factor, expand, derivative of, integrate … from a to b, limit … as x->0 or 15% of 80.

Try an example

Before you start

This page is easier if you are comfortable with:

What Sylow theorems means

The two conditions on are very restrictive. For : and , so ; is odd and divides 3, so . For : and force , and , force ; both Sylow subgroups are unique, hence normal, and every group of order 15 is cyclic. The divisibility and congruence use congruences and prime factorisation.

For : and gives . Counting elements helps: if , there are elements of order 5, leaving too few for the other Sylow subgroups. The theorems extend Lagrange's theorem (the order of a subgroup divides the order of the group) and Cauchy's theorem. They also use divisors of the group order, see the number of divisors.

Sylow theory is the main tool for classifying small finite groups, together with the fundamental theorem of finite abelian groups when the Sylow subgroups are normal. Related counting is in orders of standard groups, and the Chinese remainder theorem (the Chinese remainder theorem) explains why a cyclic group of order 15 is a product of orders 3 and 5.

What is it used for?

Sylow theorems limit how many subgroups of prime power order a finite group can have.

How to use sylow theorems

  1. Factorise the order .
  2. List the divisors of .
  3. Keep those divisors that are .
  4. If only 1 remains, the Sylow -subgroup is unique and normal.

Graph

Divisors of 4 as candidates for n3 when |G| = 121: allowed2: not 1 mod 34: allowed00.511.522.533.5401234Divisors of 4 as candidates for n3 when |G| = 12candidateyGraph with x from 0 to 4 and y from 0 to 4.8. Shows bars (3); point 1: allowed at (1, 1); point 2: not 1 mod 3 at (2, 2); point 4: allowed at (3, 4).

Only candidates that are 1 mod 3 survive: 1 and 4.

Worked examples

These examples are worked by hand, step by step, so you can compare your own working.

Example 1: order 12, p = 3

Find the possible values of for .

Worked example
Answer
1 or 41\text{ or }4
  1. Divisors of 4
  2. ≡ 1 mod 3

Example 2: order 15

Find and for .

Worked example
Answer
n3=n5=1n_3=n_5=1
  1. n₃: divisors of 5 that are ≡ 1 mod 3
  2. n₅: divisors of 3 that are ≡ 1 mod 5

Example 3: order 30, p = 5

Find the possible values of for .

Worked example
Answer
1 or 61\text{ or }6
  1. Divisors of 6
  2. ≡ 1 mod 5

Special cases

A few situations come up again and again. Knowing them saves time and helps you spot answers that cannot be right.

Order 12

12 = 2² × 3: Sylow 2-subgroups have order 4, Sylow 3-subgroups order 3

The full prime power dividing |G|.

Counting Sylow 3-subgroups

n₃ ≡ 1 (mod 3) and n₃ divides 4, so n₃ = 1 or 4

Divisors of 4: 1, 2, 4.

Counting Sylow 2-subgroups

n₂ is odd and divides 3, so n₂ = 1 or 3

Divisors of 3: 1, 3.

Order 15

n₅ divides 3 and n₅ ≡ 1 (mod 5): n₅ = 1

Only 1 works.

Word problems

If |G| = pᵃm with p not dividing m, then G has a subgroup of order pᵃ; every two are conjugate; and the number nₚ satisfies nₚ ≡ 1 (mod p) and nₚ divides m.

Order of a Sylow subgroup

Find the order of a Sylow 2-subgroup of a group of order 24.

  1. Factorise24 = 2³ × 3
  2. Sylow 2-subgrouporder 2³ = 8
  3. Check: 8 divides 24 ✓8.

Possible n₃ for order 12

List the possible values of n₃ for |G| = 12.

  1. n₃ divides 12 ÷ 3divides 4
  2. n₃ ≡ 1 mod 31 or 4
  3. Check: 4 mod 3 = 1 ✓n₃ = 1 or 4.

Order 15 Higher

Show a group of order 15 has a unique Sylow 5-subgroup.

  1. n₅ divides 31 or 3
  2. n₅ ≡ 1 mod 5only 1
  3. Check: 3 mod 5 = 3 ✗ so n₅ = 1 ✓n₅ = 1.

Counting elements Higher

If n₃ = 4 for order 12, how many elements of order 3 are there?

  1. Each Sylow 3-subgroup2 elements of order 3
  2. Four subgroups4 × 2
  3. Check: 8 ✓8.

Common mistakes

Using the wrong divisibility

nₚ divides |G| ✗

nₚ divides m, the part coprime to p ✓

For |G| = 12, n₃ divides 4 not 12.

Forgetting the congruence

n₃ = 2 is possible ✗

n₃ ≡ 1 (mod 3) ✓

2 mod 3 = 2.

Assuming uniqueness

there is always one Sylow p-subgroup ✗

it is unique only if nₚ = 1 ✓

Then it is normal.

Wrong order

Sylow 2-subgroup of order 2 in a group of order 12 ✗

order 4 ✓

Take the full power 2².

Exam tips

  1. Factorise |G| first.
  2. nₚ ≡ 1 (mod p).
  3. nₚ divides m.
  4. nₚ = 1 gives a normal subgroup.
  5. Count elements carefully.

Practice questions

Try each one on paper, then open the answer. Use the solver above to see the full working.

1. Order of a Sylow 3-subgroup in order 18 Foundation

9

2. Order of a Sylow 5-subgroup in order 20 Foundation

5

3. Order of a Sylow 2-subgroup in order 40 Foundation

8

4. n₇ for |G| = 21 divides 3 and ≡ 1 mod 7: value Higher

1

5. Elements of order 5 if n₅ = 6 in order 30 Higher

24

6. n₂ possible values for |G| = 20: largest odd divisor of 5 Higher

5

Practice generator

Unlimited fresh questions with instant marking. Choose a level, work it out on paper, then type your answer.

Solve: …

Key terms

Sylow p-subgroup
A subgroup of order pᵃ, the largest power of p dividing
nₚ
The number of Sylow p-subgroups.
Normal subgroup
A subgroup fixed by conjugation.
Conjugate
Related by gxg⁻¹.
p-group
A group of prime-power order.
Lagrange’s theorem
Subgroup orders divide

Frequently asked questions

What do the Sylow theorems say?

Sylow p-subgroups exist, are conjugate, and nₚ ≡ 1 (mod p) divides m.

What is nₚ?

The number of Sylow p-subgroups.

When is a Sylow subgroup normal?

When nₚ = 1.

What are n₃ for order 12?

1 or 4.

Which page covers finite abelian groups?

fundamental theorem of finite abelian groups.

Which page covers prime factors?

prime factor form.

More in Analysis, algebra and topology and the formula sheets.