IMO 2026 · Problem 1
Source: IMO 2026, day 1 · Official statement
Statement reformulated, mathematically equivalent to the official one.
A blackboard carries integers, all strictly greater than (repetitions are allowed).
A move consists of choosing two numbers and on the board (at two different positions), both strictly greater than , erasing them, and writing in their place the two numbers
The game continues as long as a move is possible, that is, as long as at least two numbers on the board are strictly greater than .
(a) Show that, whatever choices are made, the game stops after finitely many moves, and that exactly one integer strictly greater than then remains on the board.
(b) Show that this final integer does not depend on the choices made (it is entirely determined by the starting numbers).
Student's paper
Nothing is saved on our servers: if you refresh or leave the page, the paper and its score are lost. Your exercises, prompt and model choice stay in this browser.