Maths Olympiad Prep

Track / Stage 6 / 163 of 400 #1803 of 2604

Problem 1803

National Olympiad, first round
Algebra Difficulty 6.2 Prove it Brazilian Math Olympiad · Brazil

Find all functions f:Z→Zf: \mathbb{Z} \to \mathbb{Z} such that
(i) f(f(n))=f(n+1)f(f(n)) = f(n+1) for all n∈Zn \in \mathbb{Z};
(ii) f(2009n+2008)=2009⋅f(n)f(2009n + 2008) = 2009 \cdot f(n) for all n∈Zn \in \mathbb{Z}.

This one wants a proof. Work it on paper, then read the official solution and mark yourself. Be honest about it: the record is only any use to you if it is.

Next problem →

Official solution

If ff is injective, then f(f(n))=f(n+1)f(f(n)) = f(n+1) reduces to f(n)=n+1f(n) = n+1, one of the solutions, another solution is f(n)=0f(n) = 0 for all n∈Zn \in \mathbb{Z}. So suppose ff is neither injective nor identically zero. So there are two integers a<ba < b such that f(a)=f(b)f(a) = f(b). By applying (i) we obtain f(a+1)=f(f(a))=f(f(b))=f(b+1)f(a+1) = f(f(a)) = f(f(b)) = f(b+1) and one can deduce by induction that f(a+n)=f(b+n)f(a+n) = f(b+n), i.e., f(n)f(n) is periodic for n≥an \ge a and therefore bounded.

We will prove that f(n)=0f(n) = 0 for n≥−1n \ge -1. Suppose the contrary and let k≥nk \ge n be such that f(k)=Mf(k) = M has maximum absolute value. By (ii), ∣f(2009k+2008)∣=∣2009f(k)∣=2009∣M∣|f(2009k + 2008)| = |2009f(k)| = 2009|M|. So either n>2009k+2008≥2009n+2008  ⟹  n<−1n > 2009k + 2008 \ge 2009n + 2008 \implies n < -1 or M=0M = 0. Since n≥−1n \ge -1, M=0M = 0 and so f(N)=0f(N) = 0 for all N≥nN \ge n, and in particular f(n)=0f(n) = 0.

Now suppose that there exist a<ba < b such that f(a)=f(b)≠0f(a) = f(b) \ne 0. Then, again by the argument above f(n)f(n) is periodic for n≥an \ge a and so f(a)=f(b)=0f(a) = f(b) = 0, a contradiction. So if f(a),f(b)≠0f(a), f(b) \ne 0 then f(a)≠f(b)f(a) \ne f(b).

Now we will prove that the set of negative integers tt such that f(t)=0f(t) = 0 is finite. Suppose it's not, so for every integer kk there is an integer rr such that f(r)=0f(r) = 0 and r<kr < k. By applying (i) repeatedly just like before we prove that f(n)=0f(n) = 0 for all n≥rn \ge r; in particular f(k)=0f(k) = 0, and the function is identically zero. So there is an maximum integer cc such that f(n)≠0f(n) \ne 0 for all n≤cn \le c. Since ff is injective in Z∩]−∞,c[\mathbb{Z} \cap ]-\infty, c[, for n<cn < c we have f(f(n))=f(n+1)≠0  ⟹  f(n)=n+1f(f(n)) = f(n+1) \ne 0 \implies f(n) = n+1. Now if n<−1n < -1 we have 2009n+2008<n2009n+2008 < n; for example, 2009c+2008<c2009c+2008 < c. Then f(2009c+2008)=2009f(c)  ⟺  2009c+2009=2009f(c)  ⟺  f(c)=c+1f(2009c+2008) = 2009f(c) \iff 2009c + 2009 = 2009f(c) \iff f(c) = c+1. Finally, from 2009(c+1)+2008<c+1  ⟹  2009(c+1)+2008≤c2009(c+1) + 2008 < c+1 \implies 2009(c+1) + 2008 \le c we have f(2009(c+1)+2008)−2009f(c+1)  ⟺  f(c+1)=c+2f(2009(c+1)+2008)-2009f(c+1) \iff f(c+1) = c+2. But f(c+1)=0f(c+1) = 0, so c=−2c = -2. So we have a third solution
f(n)={n+1,if n<00,if n≥0 f(n) = \begin{cases} n+1, & \text{if } n < 0 \\ 0, & \text{if } n \ge 0 \end{cases}
It can be easily verified that this solution also satisfies the required conditions.

Source: MathNet, licensed CC-BY-4.0. Statement reproduced verbatim; metadata (topic, difficulty, ordering) added by this project.