Skip to main content
OlympiadHQ

Browse · MathNet

Print

International Mathematical Olympiad Shortlisted Problems

counting and probability

Problem

Prove that in any set of distinct real numbers there exist two pairs and with or , such that
Solution
For any set of distinct real numbers, let be the distances between them, displayed with their multiplicities. Here . By rescaling the numbers, we may assume that the smallest distance between two elements of is . Let for . Evidently is the difference between the largest element and the smallest element of .

If for some then the required inequality holds, because . Otherwise, the reverse inequality holds for each , and therefore From , together with the fact that for all , , we get and so .

Since the distance of to at least one of the numbers is at least , we have for some . Since , we have either (if ) or (if ). If , selecting , , and (so that ), we obtain Otherwise, if , we may choose , , and (so that ), and obtain The desired result follows.

Techniques

Coloring schemes, extremal arguments