21
$\begingroup$

I am reading the Wikipedia article entitiled Sylow theorems. This short segment of the article reads:

Part of Wilson's theorem states that $(p-1)!$ is congruent to $-1$ (mod $p$) for every prime $p$. One may easily prove this theorem by Sylow's third theorem. Indeed, observe that the number $n_p$ of Sylow's $p$-subgroups in the symmetric group $S_p$ is $(p-2)!$. On the other hand, $n_p ≡ 1$ mod p. Hence, $(p-2)! ≡ 1$ mod $p$. So, $(p-1)! ≡ -1$ mod $p$.

I do not understand why the number of Sylow p-subgroups of $S_p$ is $(p-2)! $

I am taking a course in Group Theory and I have studied everything in Dummit and Foote up to Sylow's theorem. I have also had an introductory course in number theory and am familiar with basic combinatorics.

$\endgroup$
2

1 Answer 1

Reset to default
25
$\begingroup$

The elements of order $p$ consist of a $p$-cycle of the form $(1,a_2,a_3,\ldots,a_p)$, where $a_2,a_3,\ldots,a_p$ is a permutation of $2,3,\ldots,p$. So there are exactly $(p-1)!$ elements of order $p$.

Now each subgroup of order $p$ contains $p-1$ elements of order $p$ (i.e. its non-identity elements), and the intersection of any two such subgroups is trivial, so the total number of subgroups of order $p$ is $(p-1)!/(p-1) = (p-2)!$.

$\endgroup$
8
  • $\begingroup$ This is one line more than the solution of "see page number $2$" (which is good, of course). $\endgroup$ Commented Nov 14, 2015 at 20:06
  • 1
    $\begingroup$ And it saves one click! $\endgroup$ Commented Nov 14, 2015 at 20:14
  • 1
    $\begingroup$ OK, Thanks. I see now that generally the number of cyclic subgroups of order m in S_n is binomial(n,m)*(m-1)!/phi(m) where phi(m) is the number of positive integers less than m that are relatively prime to m. $\endgroup$ Commented Nov 14, 2015 at 21:35
  • 1
    $\begingroup$ Unfortunately it is not as simple as that. For example, when $n=m=6$, in addition to elements like $(1,2,3,4,5,6)$, you also have those like $(1,2)(3,4,5)$. $\endgroup$ Commented Nov 14, 2015 at 22:29
  • $\begingroup$ Yes, Thank you Derek Holt. I agree. What I think we can say is this: The number of subgroups in S_n of order p (where p is a prime dividing n) is binomial(n,p)*(p-2)!. $\endgroup$ Commented Nov 15, 2015 at 17:27

You must log in to answer this question.

Start asking to get answers

Find the answer to your question by asking.

Ask question

Explore related questions

See similar questions with these tags.