olymmath

ISL 2012 C1

Several positive integers are written in a row. Iteratively, Alice chooses two adjacent numbers xx and yy such that x>yx>y and xx is to the left of yy, and replaces the pair (x,y)(x, y) by either (y+1,x)(y+1, x) or (x−1,x)(x-1, x). 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).

Locator isl/2012/c1 · Tag MG9VJJJ19B · Edit this page on GitHub · Keys: j next, k previous