Maths Olympiad Prep

Library / /13 of 87

Algebra Difficulty 5.5 AIME, harder Prove it Serbia

Problem:

A natural number kk is given. Let f:ZZf: \mathbb{Z} \rightarrow \mathbb{Z} be a bijection such that for any two integers ii and jj for which ijk|i-j| \leqslant k, it holds that f(i)f(j)k|f(i)-f(j)| \leqslant k. Prove that for all i,jZi, j \in \mathbb{Z} it holds that
f(i)f(j)=ij |f(i)-f(j)|=|i-j|

Solution

Solution:

For k=1k=1 the statement is trivial. So let k>2k>2. Call an interval of length kk a set of the form {x,x+1,,x+k},xZ\{x, x+1, \ldots, x+k\}, x \in \mathbb{Z}. Two integers xx and yy will be called consecutive if and only if there exist intervals I1I_{1} and I2I_{2} of length kk for which I1I2={x,y}I_{1} \cap I_{2}=\{x, y\}. However, by the condition of the problem f(I1)f\left(I_{1}\right) and f(I2)f\left(I_{2}\right) are also intervals of length kk, so since {f(x),f(y)}=f(I1)f(I2)\{f(x), f(y)\}=f\left(I_{1}\right) \cap f\left(I_{2}\right), it follows that f(x)f(x) and f(y)f(y) are also consecutive numbers. From this, f(x+1)f(x)=1|f(x+1)-f(x)|=1 for xZx \in \mathbb{Z}. Finally, using the injectivity of the mapping, by a simple induction on nn we obtain that f(x+n)f(x)=n|f(x+n)-f(x)|=n.

Want a route through all this instead of an archive? The track puts 2,000 problems in a working order, from AMC 10 level to the IMO shortlist.

Source: MathNet, licensed CC-BY-4.0. Statement translated into English from sr; metadata (topic, difficulty) added by this project.