Math AI Grader
Free trial, no account needed
Back to exercises

IMO 2026 · Problem 1

Number theoryEasy

Source: IMO 2026, day 1 · Official statement

Statement reformulated, mathematically equivalent to the official one.

A blackboard carries 20262026 integers, all strictly greater than 11 (repetitions are allowed).

A move consists of choosing two numbers mm and nn on the board (at two different positions), both strictly greater than 11, erasing them, and writing in their place the two numbers gcd⁡(m,n)andlcm⁡(m,n)gcd⁡(m,n).\gcd(m,n) \qquad\text{and}\qquad \frac{\operatorname{lcm}(m,n)}{\gcd(m,n)}.

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 11.

(a) Show that, whatever choices are made, the game stops after finitely many moves, and that exactly one integer strictly greater than 11 then remains on the board.

(b) Show that this final integer does not depend on the choices made (it is entirely determined by the 20262026 starting numbers).

Student's paper

0 / 20,000

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.