Write with . A Sylow -subgroup of is a subgroup of order — a -subgroup of the largest conceivable order. The number of Sylow -subgroups of is denoted .
Examples
Example 1.22
Let with primes and . Then and force (as ); and force (as ). Let be the two normal Sylows: (coprime orders), so (Exercise 1.4) and by Proposition 1.24 below. Every group of order , , , … is cyclic. The excluded case produces exactly one more group, nonabelian — see the weekend problem (Problem 1.1).
Example 1.23 (A complete Sylow census: )
Let us run the method on , . Sylow : , , so ; since and are distinct, — the four subgroups , one for each -element subset , accounting for the three-cycles. By Sylow II they are conjugate, and the conjugation morphism is an isomorphism here (its kernel is contained in of order , and a normal subgroup of inside -like must be trivial: it would consist of even permutations fixing the four Sylows, and only does). Sylow : , : . The subgroup has order (a dihedral : the symmetries of the square with vertices ), is not normal ( generates a different -cycle subgroup), so : the three copies of correspond to the three ways of pairing points into a “square”. Note the moral of the census: leaves room for either Sylow to fail normality, and both do — compare order , where the count forces one of them normal (Part IV of Problem 1.1).