Let be a simple group with 168 elements. How many elements of order 7 does contain?
Notation: An element has order 7 if but for any positive integer (Here is the identity of the group )
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
The third Sylow theorem says that the number n 7 of Sylow 7 -subgroups is ≡ 1 ( m o d 7 ) and divides 1 6 8 / 7 = 2 4 . So n 7 = 1 or 8 . If n 7 = 1 then the unique Sylow 7 -subgroup is a normal subgroup , so G is not simple.
So n 7 = 8 . There are 8 distinct subgroups of order 7 . The order of every non-identity element in each subgroup is 7 (it divides 7 by Lagrange's theorem ), so there are six non-identity elements in each subgroup with order 7 . Also, any two Sylow 7 -subgroups have trivial intersection (their intersection has order dividing 7 by Lagrange's theorem, and if it equals 7 then they are the same subgroup). So these six elements are distinct. There are thus a total of 6 ⋅ 8 = 4 8 elements of order 7 in these subgroups.
Finally, any element g of order 7 generates a cyclic subgroup of order 7 , namely { 1 , g , g 2 , … , g 6 } . This is a Sylow 7 -subgroup. So g is contained in one of these Sylow 7 -subgroups, so these 4 8 elements are all the elements of order 7 .
( Aside: It can be shown that G ≅ G L 3 ( F 2 ) , the group of invertible 3 × 3 matrices with entries in the field with two elements. For extra extra credit, try to write down the 4 8 elements of order 7 in G explicitly!)