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 then is not simple.
Answers
Proof. Here .
By Sylow’s Theorem,
thus
Assume for the sake of contradiction that is simple. Then , so
Since distinct Sylow subgroups have trivial intersection, there are
- elements of order 17,
- elements of order 11,
- elements of order 7.
Hence
Since , this is a contradiction, which proves that is not simple.
If then 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]