We just finished a lesson about determinants and the symmetric group with all what comes with it ( permutations, transpositions etc... ), except we didn't do group theory ( we only see it next year ), just some general algebra. But I'd like to know if there are some nice problems online about permutations ( like for example Muirhead's inequality ).

Thanks !

-
"Nice" is such a personal thing...and without grout theory that's even more limited. Also I'm not sure how Muirhead's ineq. fits in here... – DonAntonio May 21 '12 at 11:21
Grout theory? Well, I guess you can apply it to tilings.... – Gerry Myerson May 21 '12 at 12:50
I don't know if they are available on-line, but John D. Dixon's Problems in Group Theory (Dover) Chapter 2 is about permutation groups, and de Souza and Silva's Berkeley Problems in Mathematics, section 6.5, is about $S_n$, $A_n$, $D_n$, etc. – Arturo Magidin May 21 '12 at 16:39

Let $1 < m < n$. Show that $\langle (1 2 \cdots m), (1 2 \cdots n) \rangle$ has a $3$-cycle. (I was trying to remember a problem that I have done in Isaacs' book. I might have remembered wrong, though I think it's right. But since you want a problem, if the statement is wrong, just tweak the problem and prove it wrong.)