ISL 2012 C1
Several positive integers are written in a row. Iteratively, Alice chooses two adjacent numbers and such that and is to the left of , and replaces the pair by either or . Prove that she can perform only finitely many such iterations.
Official text Transcription from NuminaMath olympiads, checked word for word against the official paper. Quoted with source.
Official text: IMO 2012 Shortlist booklet, page 5.
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).