Find all integers n≥2 for which there exist x1,x2,…,xn∈R∗ such that x1+x2+⋯+xn=x11+x21+⋯+xn1=0.
Solution
Let M be the set of the numbers n that satisfy the conditions above. We shall show that M=N∖{0,1,3}.
We can observe that 2p∈M, for any p≥1, the relations being satisfied e.g. for x1=x2=⋯=xp=1 and xp+1=xp+2=⋯=x2p=−1.
Moreover, if n∈M and x1+x2+⋯+xn=x11+x21+⋯+xn1=0, taking xn+1=1 and xn+2=−1, we conclude that n+2∈M, because x1+x2+⋯+xn+xn+1+xn+2=x11+x21+⋯+xn1+xn+11+xn+21=0.
Therefore, all that is left to be done is to find the smallest odd element of M. Suppose that 3∈M; then there exist x1,x2,x3∈R∗ so that x1+x2+x3=x11+x21+x31=0.
This leads to x12+x1x2+x22=0, which is possible if and only if x1=x2=0, contradiction. It follows that 3∈/M.
Let us search for an example to prove that 5∈M. Take x1=x2=x3=−1; then x4+x5=3 and x4x5=1, which leads to x4,5=23±5.
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.