Permutation for finding the smallest positive integer Let $\pi = (1,2)(3,4,5,6,7)(8,9,10,11)(12) \in S_{12}$. Find the smallest positive integer $k$ for which $$\pi^{(k)}=\pi \circ \pi \circ\ldots\circ \pi = \iota$$
Generalize. If a $\pi$'s disjoint cycles have length $n_1, n_2,\dots,n_t$, what is the smallest integer $k$ so that $\pi^{(k)} = \iota$?
I'm confused with this question. A clear explanation would be appreciated.
 A: $\iota$ represents the identity permutation: every element in $\{1, 2, ..., 12\}$ is mapped to itself: 
$\quad \iota = (1)(2)(3)(4)(5)(6)(7)(8)(9)(10)(11)(12)$.
Recall the definition of the order of any element of a finite group. 
In the case of a permutation $\pi$ in $S_n$, the exponent $k$ in your question represents the order of $\pi$. 
That is, if $\;\pi^k = \underbrace{\pi\circ \pi \circ \cdots \circ \pi}_{\large k \; times}\; = \iota,\;$ and if $k$ is the least such positive integer such that $\pi^k = \iota$, then $k$ is the order of $\pi$.
A permutation expressed as the product of disjoint cycles has order $k$ equal to the least common multiple of the lengths of the cycles.  

So, if $\pi = (1,2)(3,4,5,6,7)(8,9,10,11)(12) \in S_{12}$,
Then the lengths $n_i$ of the 4 disjoint cycles of $\pi$ are, in order of their listing above, $n_1 = 2, \; n_2 = 5, \; n_3 = 4,\;n_4 = 1.\;$. 
So the order $k$ of $\pi$ is given by the least common multiple $$\;\text{lcm}\,(n_1, n_2, n_3, n_4) = \operatorname{lcm}(2, 5, 4, 1) = 20.$$  That is, $\pi^k = \pi^{20} = \iota,\;$ and there is NO positive integer $n<k = 20\,$ such that $\pi^n = \iota$.
What this means is that $$\underbrace{\pi \circ \pi \circ \cdots \circ \pi}_{\large 20 \; factors} = \iota$$ and $$\underbrace{\pi \circ \pi \circ \cdots \circ \pi}_{ n \; factors,\;1 \,\lt n\, \lt 20} \neq \iota$$
