Maths Olympiad Prep

Library / IMO Shortlist /35 of 365

IMO Shortlist

Combinatorics Difficulty 7.8 National Olympiad, round 2 Prove it IMO

Prove that in any set of 20002000 distinct real numbers there exist two pairs a>ba > b and c>dc > d with a≠ca \neq c or b≠db \neq d, such that
∣a−bc−d−1∣<1100000 \left|\frac{a-b}{c-d}-1\right|<\frac{1}{100000}

Solution

For any set SS of n=2000n=2000 distinct real numbers, let D1⩽D2⩽⋯⩽DmD_{1} \leqslant D_{2} \leqslant \cdots \leqslant D_{m} be the distances between them, displayed with their multiplicities. Here m=n(n−1)/2m = n(n-1)/2. By rescaling the numbers, we may assume that the smallest distance D1D_{1} between two elements of SS is D1=1D_{1} = 1. Let D1=1=y−xD_{1} = 1 = y - x for x,y∈Sx, y \in S. Evidently Dm=v−uD_{m} = v - u is the difference between the largest element vv and the smallest element uu of SS.

If Di+1/Di<1+10−5D_{i+1}/D_{i} < 1 + 10^{-5} for some i=1,2,…,m−1i = 1, 2, \ldots, m-1 then the required inequality holds, because 0⩽Di+1/Di−1<10−50 \leqslant D_{i+1}/D_{i} - 1 < 10^{-5}. Otherwise, the reverse inequality
Di+1Di⩾1+1105 \frac{D_{i+1}}{D_{i}} \geqslant 1 + \frac{1}{10^{5}}
holds for each i=1,2,…,m−1i = 1, 2, \ldots, m-1, and therefore
v−u=Dm=DmD1=DmDm−1⋯D3D2⋅D2D1⩾(1+1105)m−1 v-u = D_{m} = \frac{D_{m}}{D_{1}} = \frac{D_{m}}{D_{m-1}} \cdots \frac{D_{3}}{D_{2}} \cdot \frac{D_{2}}{D_{1}} \geqslant \left(1 + \frac{1}{10^{5}}\right)^{m-1}
From m−1=n(n−1)/2−1=1000⋅1999−1>19⋅105m-1 = n(n-1)/2 - 1 = 1000 \cdot 1999 - 1 > 19 \cdot 10^{5}, together with the fact that for all n⩾1n \geqslant 1, (1+1n)n⩾1+(n1)⋅1n=2\left(1 + \frac{1}{n}\right)^{n} \geqslant 1 + \binom{n}{1} \cdot \frac{1}{n} = 2, we get
(1+1105)19⋅105=((1+1105)105)19⩾219=29⋅210>500⋅1000>2⋅105 \left(1 + \frac{1}{10^{5}}\right)^{19 \cdot 10^{5}} = \left(\left(1 + \frac{1}{10^{5}}\right)^{10^{5}}\right)^{19} \geqslant 2^{19} = 2^{9} \cdot 2^{10} > 500 \cdot 1000 > 2 \cdot 10^{5}
and so v−u=Dm>2⋅105v-u = D_{m} > 2 \cdot 10^{5}.

Since the distance of xx to at least one of the numbers u,vu, v is at least (u−v)/2>105(u-v)/2 > 10^{5}, we have
∣x−z∣>105 |x-z| > 10^{5}
for some z∈{u,v}z \in \{u, v\}. Since y−x=1y-x = 1, we have either z>y>xz > y > x (if z=vz = v) or y>x>zy > x > z (if z=uz = u). If z>y>xz > y > x, selecting a=za = z, b=yb = y, c=zc = z and d=xd = x (so that b≠db \neq d), we obtain
∣a−bc−d−1∣=∣z−yz−x−1∣=∣x−yz−x∣=1z−x<10−5. \left|\frac{a-b}{c-d} - 1\right| = \left|\frac{z-y}{z-x} - 1\right| = \left|\frac{x-y}{z-x}\right| = \frac{1}{z-x} < 10^{-5}.
Otherwise, if y>x>zy > x > z, we may choose a=ya = y, b=zb = z, c=xc = x and d=zd = z (so that a≠ca \neq c), and obtain
∣a−bc−d−1∣=∣y−zx−z−1∣=∣y−xx−z∣=1x−z<10−5. \left|\frac{a-b}{c-d} - 1\right| = \left|\frac{y-z}{x-z} - 1\right| = \left|\frac{y-x}{x-z}\right| = \frac{1}{x-z} < 10^{-5}.
The desired result follows.

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.