Maths Olympiad Prep

Library / /21 of 22

Algebra Difficulty 6.6 National Olympiad Prove it Romania

Find all integers n2n \ge 2 for which there exist x1,x2,,xnRx_1, x_2, \dots, x_n \in \mathbb{R}^* such that
x1+x2++xn=1x1+1x2++1xn=0. x_1 + x_2 + \dots + x_n = \frac{1}{x_1} + \frac{1}{x_2} + \dots + \frac{1}{x_n} = 0.

Solution

Let MM be the set of the numbers nn that satisfy the conditions above. We shall show that M=N{0,1,3}M = \mathbb{N} \setminus \{0, 1, 3\}.

We can observe that 2pM2p \in M, for any p1p \ge 1, the relations being satisfied e.g. for x1=x2==xp=1x_1 = x_2 = \dots = x_p = 1 and xp+1=xp+2==x2p=1x_{p+1} = x_{p+2} = \dots = x_{2p} = -1.

Moreover, if nMn \in M and x1+x2++xn=1x1+1x2++1xn=0x_1 + x_2 + \dots + x_n = \frac{1}{x_1} + \frac{1}{x_2} + \dots + \frac{1}{x_n} = 0, taking xn+1=1x_{n+1} = 1 and xn+2=1x_{n+2} = -1, we conclude that n+2Mn+2 \in M, because
x1+x2++xn+xn+1+xn+2=1x1+1x2++1xn+1xn+1+1xn+2=0. x_1 + x_2 + \dots + x_n + x_{n+1} + x_{n+2} = \frac{1}{x_1} + \frac{1}{x_2} + \dots + \frac{1}{x_n} + \frac{1}{x_{n+1}} + \frac{1}{x_{n+2}} = 0.

Therefore, all that is left to be done is to find the smallest odd element of MM.
Suppose that 3M3 \in M; then there exist x1,x2,x3Rx_1, x_2, x_3 \in \mathbb{R}^* so that
x1+x2+x3=1x1+1x2+1x3=0. x_1 + x_2 + x_3 = \frac{1}{x_1} + \frac{1}{x_2} + \frac{1}{x_3} = 0.

This leads to x12+x1x2+x22=0x_1^2 + x_1 x_2 + x_2^2 = 0, which is possible if and only if x1=x2=0x_1 = x_2 = 0, contradiction. It follows that 3M3 \notin M.

Let us search for an example to prove that 5M5 \in M. Take x1=x2=x3=1x_1 = x_2 = x_3 = -1; then x4+x5=3x_4 + x_5 = 3 and x4x5=1x_4 x_5 = 1, which leads to x4,5=3±52x_{4,5} = \frac{3 \pm \sqrt{5}}{2}.

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.