Question

Prove that S_n is non-Abelian for n>=3. S_n is the group of permutations of n letters.

I think one way of doing this would be by showing that the only element of the centralizer is e, the identity...does anyone else have anything better?