The **symmetric group** is the group $S_n$ of bijections from $n$ element sets to themselves (called permutations), which is of order $n!$. This group is solvable for $n\leq 4$ and almost simple since $S_n=A_n\rtimes C_2$ for $n\geq 5$.

**Authors:**

**Knowl status:**

- Review status: reviewed
- Last edited by Tim Dokchitser on 2019-05-23 20:30:43

**Referred to by:**

**History:**(expand/hide all)

**Differences**(show/hide)