I dont even know where to start on this one.
Show for n>2, the group of permutations on n elements is non-abelian.
Thanks!
It would mean all of group theory can be summarized in 60 pages.
I just want to add, since NonCommAlg was implicit about this, this condition is necessary to have a third element. If n>=2 then writing (12)(23) is not allowed since there is no third element. That is why this condition is necessary.Show for n>2