Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

Let $\,n\in\mathbb{N}\,$ and $p$ a prime. Let $P$ be a Sylow $p$-subgroup of $\,S_n\,$. If $p$ does not divide $n$, then $\,P\leq S_{n-1}\,$. Why?

share|cite|improve this question
Well, how many times does $p$ divide the order of the group? – Tobias Kildetoft Dec 4 '12 at 18:51
The answer is $p^{[n/p]+[n/p^{2}]+...}$. Here [n/p] denotes the largest integer$\leq$n/p – suergin Dec 4 '12 at 18:58
Ok, now compare that to the number of times $p$ divides the order of the smaller group. – Tobias Kildetoft Dec 4 '12 at 19:00
It also divides the order of the smaller group. – suergin Dec 4 '12 at 19:06
The way you have written it, it is not true. Some of the p-Sylows are subgroups of $S_{n-1}$. – Phira Dec 4 '12 at 19:10

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Browse other questions tagged or ask your own question.