Let $n \ge 3$. Prove that there are $n!$ different one-to-one homomorphisms from $D_n$ to $S_n$ 
Let $n \ge 3$. Prove that there are $n!$ different one-to-one homomorphisms from $D_n$ to $S_n$.

I know there are $n!$ elements in $S_n$, but this fact didn't get me anywhere. 
I tried many things but nothing seems to be the right way for solving this question. Any help or hint will be appreciated. 
 A: Let $D_n$ be the group generated by $x$ and $y$ with the relations $x^n=e$, $y^2=e$, $yx=x^{-1}y$.
Beware that the question is (hopefully) only asking you to prove that there are at least $n!$ injective homomorphisms $D_n\to S_n$. In most cases there will be more than that.
For example for $n=15$, @orangeskid's construction gives you $15!$ different homomorphisms, but there are ones that don't arise in that way; for example the one given by
$$ \begin{align} x \mapsto {} & (1\;2\;3)(4\;5\;6\;7\;8) \\
y \mapsto {} & (2\;3)(5\;8)(6\;7) \end{align} $$

As noted by the answer by orangeskid, considering the actions of $D_n$ on the corners of a regular $n$-gon will give you $n!$ different homomorphisms given by different labellings of the corners provided that $n$ is odd.
For the case of even $n$, note that $D_n$ acts both on the corners of the $n$-gon and on its sides. And the action of $y$ on the sides is clearly distinguishable from the action on the corners.

(Bonus exercise: Prove that there are exactly $n!$ injective homomorphisms if and only if $n$ is a prime power.)
A: HINT:
$D_n$ is the group of symmetries or a regular $n$-gon, so is a subgroup of the group of permutations  of the vertices . You can label the vertices of the $n$-gon with the numbers $1, \ldots ,n$ in $n!$ ways. Each such labelling provides a map from $D_n$ to $S_n$. 
$\bf{Added:}$ As noticed by @Henning Makholm:, if $n$ is even, we will not get in this way $n!$ distinct maps, but rather $\frac{n!}{2}$, since relabelling with a symmetry wr to the center of the polygon produces the same mapping. So this is still incomplete. 
I'll try to explain to myself what happens. Let $i\colon D_n \subset S_n$ with the standard imbedding ( the standard labelling of the vertices). Each permutation of the labelling $\sigma \in S_n$ gives the map $\sigma \circ i \circ \sigma^{-1}$. However, note that there may be $\sigma$ in $S_n$ that commute with the all the elements that are in $i(D_n)$, and those give the same $i$. OK, this happens only if $n$ is even, and the centralized of $i(D_n)$ has two elements, id and the reflection $r$ wr to the center. Hence, $\sigma$ and $\sigma \circ r$ give the same imbedding of $D_n$. 
A: If I understand correctly what $D_n$ means for you, it is a group generated by two elements--say $x$ and $y$--such that $x^n=y^2=xyxy=1.$
If a homomorphism $\varphi:D_n\to S_n$ is be a one-to-one mapping, then, the following conditions hold:


*

*$\varphi(x)$ has order $n$

*$\varphi(y)$ has order $2$

*$\varphi(xy)=\varphi(x)\varphi(y)$ has order $2$


You should also be able to show that if $\varphi:D_n\to S_n$ is a homomorphism with these three properties, then it is one-to-one. Hence, we must equivalently find enough homomorphisms  with those three properties.
One might start by determining the elements of order $n$ in $S_n$--readily, there are at least $(n-1)!$ such--and the elements of order $2$--again readily, there are at least $\binom{n}{2}=\frac12 n(n-1)$ such. Then, one might determine for which $\sigma$ of order $n$ there is some $\tau$ of order $2$ for which $\sigma\tau$ has order $2,$ and how many such $\tau$ there are for each such $\sigma.$ Alternately, one might determine for which $\tau$ of order $2$ there is a $\sigma$ of order $n$ such that $\sigma\tau$ has order $2,$ and how many such $\sigma$ there are for each such $\tau.$
As a side note, having both $\tau$ and $\sigma\tau$ of order $2$ is equivalent to saying that $\tau$ has order $2$ and $\tau\sigma\tau^{-1}=\sigma^{-1}.$
Does that give you some ideas to work with?
