Maths Olympiad Prep

Library / /10 of 22

, 2014

Algebra Difficulty 5.5 AIME, harder Prove it Romania

Let SS be a set of positive integers such that x=y\lfloor \sqrt{x} \rfloor = \lfloor \sqrt{y} \rfloor for all x,ySx, y \in S. Show that the products xyxy, where x,ySx, y \in S, are pairwise distinct.

Solution

We first show that if x1,x2,x3,x4x_1, x_2, x_3, x_4 are members of SS such that x1x2x3x4x_1 x_2 \le x_3 x_4, then x1+x2x3+x4x_1 + x_2 \le x_3 + x_4. Suppose, if possible, that x1+x2>x3+x4x_1 + x_2 > x_3 + x_4. Let n=xn = \lfloor \sqrt{x} \rfloor, xSx \in S, and write xk=n2+wkx_k = n^2 + w_k, where the wkw_k are non-negative integers less than 2n+12n+1, to deduce that w1+w2w3w41w_1 + w_2 - w_3 - w_4 \ge 1. The condition x1x2x3x4x_1 x_2 \le x_3 x_4 yields (w1+w2w3w4)n2w3w4w1w2(w_1 + w_2 - w_3 - w_4)n^2 \le w_3 w_4 - w_1 w_2, so w3>0w_3 > 0 and
n2(w1+w2w3w4)n2w3w4w1w2<w3(w1+w2w3)w1w2=(w1w3)(w3w2)((w1w3)+(w3w2))2/4=(w1w2)2/4n2, \begin{aligned} n^2 &\le (w_1 + w_2 - w_3 - w_4)n^2 \le w_3 w_4 - w_1 w_2 < w_3(w_1 + w_2 - w_3) - w_1 w_2 \\ &= (w_1 - w_3)(w_3 - w_2) \le ((w_1 - w_3) + (w_3 - w_2))^2 / 4 = (w_1 - w_2)^2/4 \le n^2, \end{aligned}
which is a contradiction.

Thus, if x1,x2,x3,x4x_1, x_2, x_3, x_4 are members of SS such that x1x2=x3x4x_1 x_2 = x_3 x_4, then x1+x2=x3+x4x_1 + x_2 = x_3 + x_4, so x12+x3x4=x1(x1+x2)=x1(x3+x4)x_1^2 + x_3 x_4 = x_1(x_1 + x_2) = x_1(x_3 + x_4), i.e., (x1x3)(x1x4)=0(x_1 - x_3)(x_1 - x_4) = 0 whence x1=x3x_1 = x_3 or x1=x4x_1 = x_4. The conclusion now follows at once.

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

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