# Questions on powers of a bijection $f\colon\{1,2,\dots,n\}\to\{1,2,\dots,n\}$ [closed]

Let $f$ be a one-to-one function from $X=\{1,2,\dots,n\}$ onto $X$. Let $f^k=f\circ f\circ \cdots \circ f$ denote the $k$-fold composition of $f$ with itself.

1. Show that there are distinct positive integers $i$ and $j$ such that $f^i(x)=f^j(x)$ for all $x\in X$.
2. Show that for some positive integer $k,~~~f^k(x)=x$ for all $x\in X$.
• I feel like I'm reading a textbook ... Jul 23 '13 at 17:05
• Tell us what you know and what you can use.
– lhf
Jul 23 '13 at 17:10
• I'd like to show this using something different than what this textbook requires. Jul 23 '13 at 17:17
• I think the $f^i(x)=f^j(x)$ equality is throwing me off. Jul 23 '13 at 17:21

Hint: the powers $f^k$, like $f$, are all bijections of the finite set $X$ into itself, so they are essentially just permutations of the elements of $X$. In fact, they form a subgroup of the finite group of all permutations of $X$. (Hmmm... :) )

Apply the pigeon-hole principle. There are only finitely many bijections... how could the infinitely many powers of $f$ all be distinct?

• Powers? What do you mean "powers"? Jul 23 '13 at 23:15
• @Trancot $\{f^k\mid k\in \Bbb N\}$ Jul 24 '13 at 1:36

If you can use group theory, then this is clear because $f$ has finite order in the symmetric group $S_n$.

• Ooo! What does that mean? Maybe you could explain in detail. I'd like to learn. Jul 23 '13 at 16:57
• @MarbleKlaxon I think one could argue he gave precisely the amount of detail you need to start learning and much more detail would be robbing you of learning. Jul 23 '13 at 17:05
• @rschwieb If the details are hidden in a language he/she doesn't speak then he cannot complete the idea. The language of the problem is simpler than the names "finite order", "symmetric group", and "group theory". And the solution doesn't really require those terms.
– OR.
Jul 23 '13 at 17:22
• @RGB I certainly agree with you, but I was speaking more towards the feeling floating around that the OP is just fishing for a complete answer. I could, of course, be completely wrong, and that would make me glad. Jul 23 '13 at 20:25
• No, "just enough" would be nice. To struggle is to learn... Well, sometimes. Jul 23 '13 at 22:31