# For $n\ge1$, let $S_n$ denote the group of all permutations on $n$ symbols. How to check order of elements in $S_n$? [closed]

For $n\ge1$, let $S_n$ denote the group of all permutations on $n$ symbols.

Which of the following statements is true?

A. $S_3$ has an element of order 4

B. $S_4$ has an element of order 6

C. $S_4$ has an element of order 5

D. $S_5$ has an element of order 6

How to approach this question? Any hints?

## closed as off-topic by Derek Holt, mechanodroid, Namaste, jvdhooft, kingW3Oct 12 '17 at 13:28

This question appears to be off-topic. The users who voted to close gave this specific reason:

• "This question is missing context or other details: Please improve the question by providing additional context, which ideally includes your thoughts on the problem and any attempts you have made to solve it. This information helps others identify where you have difficulties and helps them write answers appropriate to your experience level." – Derek Holt, mechanodroid, Namaste, jvdhooft, kingW3
If this question can be reworded to fit the rules in the help center, please edit the question.

• hint: think of the elements as a multiplication of disjoint cycles. – drhab Oct 12 '17 at 8:18
• @drhab there is no element of order $6$ in $S_4$ and order $6$ element in $S_5$ is in form $(a_1a_2)(a_3a_4a_5)$. Thanks – Vincent Oct 12 '17 at 9:01

Assertion A. is false, because $\#S_3=6$ and $4\nmid6$. For a similar reason, C. is false.