Number of k-Cycles in Symmetric Group/Proof 1

Proof
Let $m$ be the number of elements of $S_n$ which are $k$-cycles.

From Cardinality of Set of Subsets, there are $\dfrac {n!} {k! \paren {n - k}!}$ different ways to select $k$ elements of $\set {1, 2, \ldots, n}$.

From Number of k-Cycles on Set of k Elements, each of these $\dfrac {n!} {k! \paren {n - k}!}$ sets with $k$ elements has $\paren {k - 1}!$ $k$-cycles.

It follows from Product Rule for Counting that: