need help on this prove?

Question

show that the set n-1 transposition:

{(12), (13), ...,(1,n)}

generates Sn.

I really really need help on this.

Answer 1

write every permutation as a product of these transpositions

Answer 2

Can you write every permutation as a product of these transpositions? For example,
(123)=(13)(12) and
(132)=(12)(13).
I'm using the convention that permutations are multiplied from right to left. if your book does it the other way, just reverse the order of the factors.
Now, how would you write (1234)? Ans: (14)(13)(12).
The rest is now an easy homework problem.