Originally Posted by

**mathcore** I have to do a few questions regarding 'permutations' and i don't know the answers!!!! now i know you people aren't here to do my homework for me but hopefully some better mathematicians than myself can give me some guidance.

let X = {x1, x2, x3 all the way up to xn} be a finite set with |X|=n>1 (duno what this means and dunno what a set is????) and let Sx denote the set of all bijective mappings f:X->X often we shall suppose that X=(1,2,3..n) so thats Sn for Sx???? (what?)

each f E Sx is convenitently represented by a standaed array of the form

so i dont even get what the queestion IS let alone how to solve it, please help!