Olympiad Maths Prep

Track / Stage 4 / 244 of 340 #504 of 2000

Problem 504

AMC 12 late, AIME early
Combinatorics Difficulty 4.9 Prove it Berkeley Math Circle: Monthly Contest 2 · United States

Problem:
Let X={1,2,,100}X=\{1,2, \ldots, 100\}. How many functions f:XXf: X \rightarrow X satisfy f(b)<f(a)+(ba)f(b)<f(a)+(b-a) for all 1a<b1001 \leq a<b \leq 100?

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

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

99a100<a99<<a199 -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)10099f(100)-100 \geq -99 and f(1)199f(1)-1 \leq 99, this shows all functions are of the form claimed above, i.e. that 1nf(n)n100n1-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)+(ba)f(b)<f(a)+(b-a) is immediate. Moreover, it is easy to see that a10099,a9998a_{100} \geq -99, a_{99} \geq -98, and so on, so 1n+an1 \leq n+a_{n} holds; similarly, n+an100n+a_{n} \leq 100 holds too. Thus n+ann+a_{n} is indeed an element of XX.

Source: MathNet, licensed CC-BY-4.0. Statement and solution reproduced as published; topic, difficulty and ordering added by this site.