Maths Olympiad Prep

Library / Berkeley Math Circle: Monthly Contest 2 /10 of 23

Berkeley Math Circle: Monthly Contest 2

Combinatorics Difficulty 4.9 AIME Prove it United States

Problem:
Let X={1,2,…,100}X=\{1,2, \ldots, 100\}. How many functions f:X→Xf: X \rightarrow X satisfy f(b)<f(a)+(b−a)f(b)<f(a)+(b-a) for all 1≤a<b≤1001 \leq a<b \leq 100?

Solution

Solution:
The answer is (199100)\binom{199}{100}. We claim that the functions are precisely those of the form f(n)=n+anf(n)=n+a_{n}, where

−99≤a100<a99<⋯<a1≤99 -99 \leq a_{100}<a_{99}<\cdots<a_{1} \leq 99

is an arbitrary sequence. The answer follows from this.

To see that all functions are of this form, we rewrite the given as f(b)−b<f(a)−af(b)-b<f(a)-a, which tells us that f(100)−100<f(99)−99<⋯<f(1)−1f(100)-100<f(99)-99<\cdots<f(1)-1. Since f(100)−100≥−99f(100)-100 \geq -99 and f(1)−1≤99f(1)-1 \leq 99, this shows all functions are of the form claimed above, i.e. that 1−n≤f(n)−n≤100−n1-n \leq f(n)-n \leq 100-n.

Finally, it remains to check that all functions of the form satisfy the conditions. The inequality f(b)<f(a)+(b−a)f(b)<f(a)+(b-a) is immediate. Moreover, it is easy to see that a100≥−99,a99≥−98a_{100} \geq -99, a_{99} \geq -98, and so on, so 1≤n+an1 \leq n+a_{n} holds; similarly, n+an≤100n+a_{n} \leq 100 holds too. Thus n+ann+a_{n} is indeed an element of XX.

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

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