Let represent the set of all functions such that for all , and .
a) Prove that is non-empty.
b) Find, with proof, whether is infinite.
c) Prove that all the elements of are bijective functions.
(Denote by the set of the nonnegative integers, and by , the composition of with itself times.)
Problem 1308
Official solution
### Part (a): Prove that is non-empty.
1. Consider a subset of which contains exactly 2008 elements.
2. Define a function such that:
This means cycles through the elements of .
3. For any , define .
4. We need to check that :
- For , because cycles through and does not return to the identity function until the 2008th iteration.
- because after 2008 applications of , each element in returns to its original position, and elements not in remain unchanged.
Thus, , proving that is non-empty.
### Part (b): Find, with proof, whether is infinite.
1. Consider the construction of as in part (a). We can choose different subsets of with 2008 elements.
2. There are infinitely many ways to choose such subsets because is infinite.
3. For each distinct subset , we can define a different function as described in part (a).
4. Therefore, there are infinitely many functions that satisfy the conditions to be in .
Thus, is infinite.
### Part (c): Prove that all the elements of are bijective functions.
1. Let . We need to show that is bijective.
2. Injectivity: Suppose . We need to show .
- If , then and , so .
- If , then is a permutation of . Since permutations are bijective, implies .
3. Surjectivity: We need to show that for every , there exists such that .
- If , then , so .
- If , since is a permutation of , there exists such that .
Thus, is bijective.