Let $r(n) = \left| \left\{ \sigma \in S_4 : \mbox{ord} ( \sigma) = n \right\} \right|$. Is it true that:
- $r(2)>r(4)$
- $r(4) > r(3)$
- $r(1)+r(3) = r(2)$
- $r(5) = r(6)$
I can write all elements of $S_4$ but I suppose that is better and faster way to solve it.
There is a formula that calculates the number of ways how a given integer can be split into parts, to be found for example here: Groupprops: Conjugacy class size formula in symmetric group:
The ways how to split $4$ are $1+1+1+1=2+1+1=2+2=3+1=4$, where each corresponds to conjugacy class of $S_4$, e.g. $2+1+1$ is a 2-cycle and two 1-cycles, The order of elements of a conjugacy class can be calculated by the least common multiple of the addends, e.g. $\operatorname{lcm}(2,1,1)=2$.
Let's do the first of your examples: $r(2)>r(4)$
$2+1+1$ and $2+2$ have $\operatorname{lcm}(2,1,1)=\operatorname{lcm}(2,2)=2$ and $4$ has $\operatorname{lcm}(4)=4$. Therefore $$ \! \frac{4!}{[(2)^1(1!)][(1)^2(2!)]} + \! \frac{4!}{(2)^2(2!)} > \frac{4!}{(4)^1(1!)}\\ 6 + 3 > 6 $$