Olympiad Maths Prep

Library / /2 of 4

Algebra Difficulty 5.9 AIME, harder Prove it Turkey

Find all real numbers aa for which there are different real numbers x,y,zx, y, z such that
x3+ay+z=y3+ax+z=z3+ax+y=3. \frac{x^3 + a}{y+z} = \frac{y^3 + a}{x+z} = \frac{z^3 + a}{x+y} = -3.

Solution

Answer: 2<a<0-2 < a < 0 and 0<a<20 < a < 2.

Letting c=x+y+zc = x + y + z, one sees that x,y,zx, y, z are the roots of the polynomial P(t)=t33t+a+3cP(t) = t^3 - 3t + a + 3c. Therefore, Vieta's theorem implies x+y+z=0x + y + z = 0, thus c=0c = 0 and P(t)=t33t+aP(t) = t^3 - 3t + a. Consequently the polynomial P(t)=t33t+aP(t) = t^3 - 3t + a has three distinct real roots. Moreover, the denominators appearing in the problem statement must be nonzero, hence the roots of P(t)P(t) are nonzero. On the other hand, the converse statement also holds: if the polynomial P(t)=t33t+aP(t) = t^3 - 3t + a has three distinct nonzero real roots, the equalities

in the problem statement are satisfied by these roots x,y,zx, y, z.
Now for a>2a > 2, one would have t3+a>t3+23tt^3 + a > t^3 + 2 \geq 3t for positive tt, thus the polynomial P(t)P(t) would have no positive root, so it could not have three real roots. Similarly for a<2a < -2, there would be no negative root and there could not be three real roots. Moreover for a=2a = 2 and a=2a = -2, the polynomial P(t)P(t) would have a double root of t=1t = 1 and t=1t = -1, respectively. Finally for a=0a = 0, one of the roots of P(t)P(t) would be 0.
Outside all these cases, one has 2<a<0-2 < a < 0 or 0<a<20 < a < 2. Indeed for 0<a<20 < a < 2, one has P(0)=a>0P(0) = a > 0 and P(1)=a2<0P(1) = a - 2 < 0, hence there is a root in each of the intervals (,0)(-\infty, 0), (0,1)(0, 1) and (1,)(1, \infty). Similarly for 2<a<0-2 < a < 0, there is a root in each of the intervals (,1)(-\infty, -1), (1,0)(-1, 0) and (0,)(0, \infty).

Looking for a route rather than 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 and solution reproduced as published; topic and difficulty added by this site.