Olympiad Maths Prep

Track / Stage 6 / 308 of 400 #1308 of 2000

Problem 1308

National olympiad, first round
Combinatorics Difficulty 6.6 Find the answer

Let A A represent the set of all functions f:NN f : \mathbb{N} \rightarrow \mathbb{N} such that for all k1,2007 k \in \overline{1, 2007}, f[k]IdN f^{[k]} \neq \mathrm{Id}_{\mathbb{N}} and f[2008]IdN f^{[2008]} \equiv \mathrm{Id}_{\mathbb{N}}.
a) Prove that A A is non-empty.
b) Find, with proof, whether A A is infinite.
c) Prove that all the elements of A A are bijective functions.
(Denote by N \mathbb{N} the set of the nonnegative integers, and by f[k] f^{[k]}, the composition of f f with itself k k times.)

This one wants a proof. Work it on paper, read the official solution, then mark yourself honestly — the ladder only means something if the record is true.

Official solution

### Part (a): Prove that A A is non-empty.

1. Consider a subset E={x1,x2,,x2008} E = \{x_1, x_2, \ldots, x_{2008}\} of N \mathbb{N} which contains exactly 2008 elements.
2. Define a function f:NN f: \mathbb{N} \to \mathbb{N} such that:
f(xi)=xi+1fori=1,2,,2007andf(x2008)=x1 f(x_i) = x_{i+1} \quad \text{for} \quad i = 1, 2, \ldots, 2007 \quad \text{and} \quad f(x_{2008}) = x_1
This means f f cycles through the elements of E E .
3. For any xE x \notin E , define f(x)=x f(x) = x .
4. We need to check that fA f \in A :
- For k{1,2,,2007} k \in \{1, 2, \ldots, 2007\} , f[k]IdN f^{[k]} \neq \mathrm{Id}_{\mathbb{N}} because f f cycles through E E and does not return to the identity function until the 2008th iteration.
- f[2008]IdN f^{[2008]} \equiv \mathrm{Id}_{\mathbb{N}} because after 2008 applications of f f , each element in E E returns to its original position, and elements not in E E remain unchanged.

Thus, fA f \in A , proving that A A is non-empty.

### Part (b): Find, with proof, whether A A is infinite.

1. Consider the construction of f f as in part (a). We can choose different subsets E E of N \mathbb{N} with 2008 elements.
2. There are infinitely many ways to choose such subsets E E because N \mathbb{N} is infinite.
3. For each distinct subset E E , we can define a different function f f as described in part (a).
4. Therefore, there are infinitely many functions f f that satisfy the conditions to be in A A .

Thus, A A is infinite.

### Part (c): Prove that all the elements of A A are bijective functions.

1. Let fA f \in A . We need to show that f f is bijective.
2. Injectivity: Suppose f(a)=f(b) f(a) = f(b) . We need to show a=b a = b .
- If a,bE a, b \notin E , then f(a)=a f(a) = a and f(b)=b f(b) = b , so a=b a = b .
- If a,bE a, b \in E , then f f is a permutation of E E . Since permutations are bijective, f(a)=f(b) f(a) = f(b) implies a=b a = b .
3. Surjectivity: We need to show that for every yN y \in \mathbb{N} , there exists xN x \in \mathbb{N} such that f(x)=y f(x) = y .
- If yE y \notin E , then f(y)=y f(y) = y , so x=y x = y .
- If yE y \in E , since f f is a permutation of E E , there exists xE x \in E such that f(x)=y f(x) = y .

Thus, f f is bijective.

\blacksquare

Source: NuminaMath-1.5, licensed Apache-2.0. Statement and solution reproduced as published; topic, difficulty and ordering added by this site.