Maths Olympiad Prep

Library / Ukrainian National Mathematical Olympiad /135 of 201

Ukrainian National Mathematical Olympiad

Algebra Difficulty 6.3 National Olympiad Prove it Ukraine

Given nn pairwise distinct positive numbers. Vasia wrote on the board all possible numbers of the form a+bca + \frac{b}{c}, where a,b,ca, b, c are distinct numbers from the given set. Can one always find two numbers on the board such that the larger one is not more than twice the other one, if

a) n=4n=4?

b) n=3n=3?

Solution

a) We will show that for four given numbers one can always find two numbers on the board such that one is not more than twice the other one. Suppose by contradiction, it is not true. Let the given numbers be a<b<c<da < b < c < d. Then d+ba>c+ba⇒d+ba>2(c+ba)⇒d+ba>1d + \frac{b}{a} > c + \frac{b}{a} \Rightarrow d + \frac{b}{a} > 2(c + \frac{b}{a}) \Rightarrow d + \frac{b}{a} > 1.

On the other hand, d+bc>d+ac⇒d+bc>2(d+ac)⇒d<bc<1d + \frac{b}{c} > d + \frac{a}{c} \Rightarrow d + \frac{b}{c} > 2(d + \frac{a}{c}) \Rightarrow d < \frac{b}{c} < 1. Thus, we get a contradiction.

b) We will give an example of three numbers for which the condition doesn't hold: a=10−1a = 10^{-1}, b=10−3b = 10^{-3} and c=10−9c = 10^{-9}. Then, the following numbers are written on the board:

10−1+10610^{-1} + 10^{6}, 10−1+10−610^{-1} + 10^{-6}, 10−3+10810^{-3} + 10^{8}, 10−3+10−810^{-3} + 10^{-8}, 10−9+10210^{-9} + 10^{2}, 10−9+10−210^{-9} + 10^{-2}.

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.