ISL 2018 C6
Let and be distinct positive integers. The following infinite process takes place on an initially empty board. (i) If there is at least a pair of equal numbers on the board, we choose such a pair and increase one of its components by and the other by . (ii) If no such pair exists, we write down two times the number 0 . Prove that, no matter how we make the choices in , operation (ii) will be performed only finitely many times. (Serbia)
Dataset text NuminaMath olympiads. Quoted with source.
Official text: IMO 2018 Shortlist booklet, page 7.
Solutions
Official solution Solution 1 by the IMO Problem Selection Committee
The terms of the source let olymmath link to this solution but not copy it. Read the solution (IMO official site).
Similar problems
These problems have the most words in common with this statement.