Y by Davi-8191, anantmudgal09, tenplusten, AlastorMoody, amar_04, SSaad, centslordm, megarnie, jhu08, mijail, Adventure10, Mango247, and 1 other user
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.
Proposed by Warut Suksompong, Thailand








Proposed by Warut Suksompong, Thailand
This post has been edited 3 times. Last edited by orl, Aug 8, 2013, 9:09 PM
Reason: Edited Title and Changed Format of The Problem.
Reason: Edited Title and Changed Format of The Problem.