Homepage Solution manuals David S. Dummit Abstract Algebra Exercise 4.5.19 ( If $|G| = 6545$ then $G$ is not simple)

Exercise 4.5.19 ( If $|G| = 6545$ then $G$ is not simple)

Prove that if | G | = 6545 then G is not simple.

Answers

Proof. Here | G | = 6545 = 5 7 11 17 .

By Sylow’s Theorem,

n 17 5 7 11 = 385 and n 17 1 ( 𝑚𝑜𝑑 17 ) , n 11 5 7 17 = 595 and n 11 1 ( 𝑚𝑜𝑑 11 ) , n 7 5 11 17 = 935 and n 7 1 ( 𝑚𝑜𝑑 7 ) ,

thus

n 17 { 1 , 35 } , n 11 { 1 , 595 } , n 7 { 1 , 85 } . (1)

Assume for the sake of contradiction that G is simple. Then n 17 1 , n 11 1 , n 7 1 , so

n 17 = 35 , n 11 = 595 , n 7 = 85 .

Since distinct Sylow subgroups have trivial intersection, there are

  • n 17 ( 17 1 ) = 35 16 = 560 elements of order 17,
  • n 11 ( 11 1 ) = 595 10 = 5950 elements of order 11,
  • n 7 ( 7 1 ) = 85 6 = 510 elements of order 7.

Hence

| G | > 560 + 5950 + 510 = 7020 .

Since | G | = 6545 , this is a contradiction, which proves that G is not simple.

If | G | = 6545 then G is not simple. □

We check (1) with sagemath:

sage: n = 5 * 7 * 11 * 17; n
6545
sage: p = 17; m = n // p; m
385
sage:  l = [d for d in range(1,m+1) if m % d == 0]; l
[1, 5, 7, 11, 35, 55, 77, 385]
sage: [d for d in l if d % p == 1]
[1, 35]
sage: p = 11; m = n // p; m
595
sage:  l = [d for d in range(1,m+1) if m % d == 0]; l
[1, 5, 7, 17, 35, 85, 119, 595]
sage: [d for d in l if d % p == 1]
[1, 595]
sage: p = 7; m = n // p; m
935
sage:  l = [d for d in range(1,m+1) if m % d == 0]; l
[1, 5, 11, 17, 55, 85, 187, 935]
sage: [d for d in l if d % p == 1]
[1, 85]

User profile picture
2026-03-16 09:49
Comments