Lemma › Guides › EGMO 2019 Problem 1: solution, and the 1 that is really a sum
Guide

EGMO 2019 Problem 1: solution, and the 1 that is really a sum

20 November 2026

EGMO 2019 Problem 1 is a system of equations, and the obvious move, solving for one variable and substituting, turns it into a mess of cubics. The way in is to notice that the two conditions do not match. One is degree 22, the other mixes degree 33 with degree 11. Fix that mismatch and the whole system factors. Here is the statement, a full solution, an independent check, and what in the wording points the way.

The problem. Find all triples (a,b,c)(a, b, c) of real numbers such that ab+bc+ca=1ab + bc + ca = 1 and a2b+c=b2c+a=c2a+ba^2b + c = b^2c + a = c^2a + b.

The signal in the statement

Look at a2b+ca^2b + c. The first term has degree 33 and the second has degree 11. Expressions like that rarely factor. But the problem hands you a 11 that is not really a 11: it is ab+bc+caab + bc + ca. Multiply the lone cc by it and cc becomes c(ab+bc+ca)c(ab + bc + ca), which has degree 33. Now every term in every expression has the same degree, and equal-degree expressions are the ones that factor.

The second signal is the shape. The three expressions are cyclic: a→b→c→aa \to b \to c \to a sends each one to the next. So whatever you prove about the first two, you get for the other pairs for free, and any solution you find comes with its cyclic shifts. That is symmetry doing the bookkeeping.

Solution

  1. Make it homogeneous. Write S=ab+bc+caS = ab + bc + ca, so S=1S = 1. Then the three expressions are E1=a2b+cSE_1 = a^2b + cS, E2=b2c+aSE_2 = b^2c + aS and E3=c2a+bSE_3 = c^2a + bS.
  2. Expand. E1=a2b+abc+bc2+c2aE_1 = a^2b + abc + bc^2 + c^2a and E2=b2c+a2b+abc+a2cE_2 = b^2c + a^2b + abc + a^2c.
  3. Subtract. The terms a2ba^2b and abcabc cancel, leaving E1−E2=bc2+c2a−b2c−a2c=−c (a2+b2−c(a+b))E_1 - E_2 = bc^2 + c^2a - b^2c - a^2c = -c\,(a^2 + b^2 - c(a + b)).
  4. Cycle it. In the same way, E2−E3=−a (b2+c2−a(b+c))E_2 - E_3 = -a\,(b^2 + c^2 - a(b + c)) and E3−E1=−b (c2+a2−b(c+a))E_3 - E_1 = -b\,(c^2 + a^2 - b(c + a)). All three differences must be 00.
  5. Case 1: one variable is zero. Say c=0c = 0. Then ab=1ab = 1 and the equations read a2b=a=ba^2b = a = b. So a=ba = b, and ab=1ab = 1 gives a2=1a^2 = 1. That leaves (1,1,0)(1, 1, 0) and (−1,−1,0)(-1, -1, 0), and both work: in the first, every expression equals 11; in the second, every expression equals −1-1. By the cyclic symmetry, a=0a = 0 or b=0b = 0 gives the cyclic shifts of these. Two variables cannot both be 00, since then ab+bc+ca=0ab + bc + ca = 0.
  6. Case 2: no variable is zero. Then each bracket in step 4 vanishes: a2+b2=c(a+b)a^2 + b^2 = c(a + b), b2+c2=a(b+c)b^2 + c^2 = a(b + c) and c2+a2=b(c+a)c^2 + a^2 = b(c + a).
  7. Add them. The left sides total 2(a2+b2+c2)2(a^2 + b^2 + c^2) and the right sides total 2(ab+bc+ca)2(ab + bc + ca). So a2+b2+c2=ab+bc+caa^2 + b^2 + c^2 = ab + bc + ca, which is the same as (a−b)2+(b−c)2+(c−a)2=0(a - b)^2 + (b - c)^2 + (c - a)^2 = 0. Each square is 00, so a=b=ca = b = c.
  8. Finish. With a=b=ca = b = c, the condition ab+bc+ca=1ab + bc + ca = 1 gives 3a2=13a^2 = 1, so a=±1/3a = \pm 1/\sqrt{3}. Every expression equals a3+aa^3 + a, so both triples work.

Answer. There are eight triples: (1,1,0)(1, 1, 0), (1,0,1)(1, 0, 1), (0,1,1)(0, 1, 1), (−1,−1,0)(-1, -1, 0), (−1,0,−1)(-1, 0, -1), (0,−1,−1)(0, -1, -1), and (t,t,t)(t, t, t) for t=1/3t = 1/\sqrt{3} and t=−1/3t = -1/\sqrt{3}.

An independent check

The proof rests on the three factorisations in steps 3 and 4 and the sum-of-squares identity in step 7. The build tests all four at twenty thousand random points, with SS kept as ab+bc+caab + bc + ca rather than set to 11, so it checks the algebra and not just one special case. It also confirms that each of the eight triples satisfies both conditions.

Then it attacks the problem without the proof. Because a+b=0a + b = 0 would make ab+bc+ca=ab=−a2ab + bc + ca = ab = -a^2, which cannot be 11, the first condition always lets you write c=(1−ab)/(a+b)c = (1 - ab)/(a + b). That leaves two equations in aa and bb. The build runs Newton's method from over fourteen thousand starting points spread across the square from −4-4 to 44, and every run that lands on a solution lands on one of the eight above. All eight are found. That is not a proof, but it is the kind of check that catches a lost case, and a lost case is the usual way this problem goes wrong.

Where marks go missing

Practise the idea

The last step, a2+b2+c2=ab+bc+caa^2 + b^2 + c^2 = ab + bc + ca forcing a=b=ca = b = c, is the equality case of a classic inequality. Olympiad problem o5-alg-3 proves that inequality from (a−b)2≥0(a - b)^2 \ge 0, and it is worth doing once by hand so you recognise the equality case the moment it appears. The daily problem posts a new one every day, no account needed.

Related guides

Train it on Lemma

Every technique here is taught explicitly, in order. 128 lessons, 1237 curated problems and unlimited generated practice at six difficulties. Free to start, no card, and the paid plan opens with 3 free days.

Find your level