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 , the other mixes degree with degree . 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 signal in the statement
Look at . The first term has degree and the second has degree . Expressions like that rarely factor. But the problem hands you a that is not really a : it is . Multiply the lone by it and becomes , which has degree . 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: 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
- Make it homogeneous. Write , so . Then the three expressions are , and .
- Expand. and .
- Subtract. The terms and cancel, leaving .
- Cycle it. In the same way, and . All three differences must be .
- Case 1: one variable is zero. Say . Then and the equations read . So , and gives . That leaves and , and both work: in the first, every expression equals ; in the second, every expression equals . By the cyclic symmetry, or gives the cyclic shifts of these. Two variables cannot both be , since then .
- Case 2: no variable is zero. Then each bracket in step 4 vanishes: , and .
- Add them. The left sides total and the right sides total . So , which is the same as . Each square is , so .
- Finish. With , the condition gives , so . Every expression equals , so both triples work.
Answer. There are eight triples: , , , , , , and for and .
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 kept as rather than set to , 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 would make , which cannot be , the first condition always lets you write . That leaves two equations in and . The build runs Newton's method from over fourteen thousand starting points spread across the square from to , 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
- Losing the zero case. Step 6 divides by , and . A solution that cancels them without comment misses six of the eight answers, and six answers out of eight is not a full solution.
- Only one zero triple. Finding and forgetting , or forgetting the cyclic shifts, is the most common partial answer. A cyclic system owes you all the rotations of every answer, and you have to list them.
- Forgetting the negative root. has two solutions. Writing only drops a triple.
- Not checking back. "Find all" means you must show your candidates really are solutions, not only that nothing else is. Each case needs its one-line verification.
- Grinding cubics. Substituting by hand is legal but leads to a high-degree polynomial in two variables. The homogenising trick in step 1 is what makes this a ten-minute problem.
Practise the idea
The last step, forcing , is the equality case of a classic inequality. Olympiad problem o5-alg-3 proves that inequality from , 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
- What to do when you have no idea how to startThe blank page is a procedure failure, not a knowledge failure. Five opening moves ordered by cost, and the rule that says when to abandon one for the next.
- How to read a hard problem without giving upMost hard problems are abandoned before they are ever attempted. Five things to do to a statement with a pen, and the rule that decides when to stop.
- When you can write WLOG, and when it breaks the proofWLOG is licensed by a symmetry, never by convenience. The one test that says which assumption you may make, and the cyclic trap that fails it.
- Schur's inequality: when to use it, and how to tell AM–GM will not doSchur's inequality is the tool for symmetric cubics that AM–GM cannot finish. How to recognise one, the second equality case that gives it away, and IMO 1964/2.
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