Maths Olympiad Prep

Track / Stage 6 / 43 of 400 #1043 of 1964

Problem 1043

National olympiad, first round
Combinatorics Difficulty 6.0 Prove it 74th NMO Selection Tests for JBMO · Romania

Determine all positive integers a,b,c,d,e,fa, b, c, d, e, f satisfying the following condition: for any two of them, xx and yy, two of the remaining four numbers, zz and tt, exist such that xy=zt\frac{x}{y} = \frac{z}{t}.

This one wants a proof. Work it on paper, then read the official solution and mark yourself. Be honest about it: the record is only any use to you if it is.

Official solution

If x=ax = a and y=fy = f, for all z,t{b,c,d,e}z, t \in \{b, c, d, e\} we have xy=afzt\frac{x}{y} = \frac{a}{f} \le \frac{z}{t}, where the equality holds for z=az = a and t=ft = f. Since z{b,c,d,e}z \in \{b, c, d, e\}, it follows that zbz \ge b, hence aba \ge b. Therefore, a=ba = b. Similarly, we infer that e=fe = f.

We now choose x=cx = c, y=dy = d. Then cd=zt\frac{c}{d} = \frac{z}{t}, where z,t{a,f}z, t \in \{a, f\}. But cdc \le d, hence c=dc = d, or cd=af\frac{c}{d} = \frac{a}{f}.

If c=dc = d, the 6-tuple (a,a,c,c,f,f)(a, a, c, c, f, f) is obviously a solution. Indeed, if xyx \ne y, we choose z=xz = x and t=yt = y, and if x=yx = y, we choose z=txz = t \ne x.

If cdc \ne d, we have cd=af\frac{c}{d} = \frac{a}{f}, thus d=cfafd = \frac{cf}{a} \ge f. It follows that a=ca = c and d=fd = f. Similarly, it is easy to prove that the 6-tuple (a,a,a,f,f,f)(a, a, a, f, f, f) is a solution.

Thus, the 6-tuple which satisfy the required condition are (a,a,b,b,c,c)(a, a, b, b, c, c), with abca \le b \le c, (a,a,a,b,b,b)(a, a, a, b, b, b), with aba \le b, and all their permutations.

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